|
"Joe Pluta" <joepluta@xxxxxxxxxxxxxxxxx> wrote:
Do the keys have to be unique across all instances?
Not at all. Each instance is completely independent of the others with respect to this process. That's why the current version uses a keyed database file in QTEMP as both a queue and a uniqueness-check.
I just ran a couple of test scenarios, in order to have base benchmarks to compare the "*USRIDX for uniqueness, *DTAQ for storage" idea to. They used TIME statements to record start and end times, which were then DSPLYed after all the shouting was over.
Writing 10100 good test records to the file, with an additional 1000 failed writes of duplicate records, and concurrently reading back the records starting after the first hundred were written, took 40 seconds. Writing and reading back 10100 good records and 2000 failed duplicates took a minute. From that I can conclude that each failed duplicate eats up 20 milliseconds, while a successful write and read-back of a record takes less than two milliseconds.
Interesting. -- JHHL
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2025 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 copyright@midrange.com.
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.
midrange.com
