×
The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.
mostly I'm with you, but in this case???
There is nothing more efficcient, than a database table, it's designed for
millions of updates and from the programmers perspective the one table for
all solutions beats them all. If you don't have a record for a new table,
the getKey function just inserts it. We've used this for a massive parallel
load process for a data warehouse and implemented a blocking mechanism (draw
x keys for one) and it outperformed even the autoincrement keys of teh
database. You've have to be precise with the locking of this table (best
was: use commit repeatable read and start with the update and read
afterwards), but once have it right and you will never have a look to it...
I'm using (at the moment, maybe it will bereplaced with sockets further on)
DataQs frequently with ArdGate, but for synchronous work, with need of
persitence, there are better solutions...
D*B
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact
[javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.
midrange.com
