Board index » cppbuilder » Re: ANN: kbmMemTable v. 4.00 released! And comments on the AidAimbenchmark.
C4D - Kim Madsen
Re: ANN: kbmMemTable v. 4.00 released! And comments on the AidAimbenchmark.
2003-07-29 04:17:21 AM
That situation may not be real life to you, but it sure as h... is real life to lots and lots of kbmMemTable users.
May be. But what kbmMemTable guys has published are not tests, it is the pack
As I have explained lots of times - but which you seem not to be willing to read, or even less understand - is
that the benchmark is not C4D's invention, its AidAim's. They chose to setup the benchmark as they did.
C4D chose to take the benchmark again with different number of records, equalling the string comparison routines.
Even in that test, kbmMemTable is much faster than SQLMemTable for less than 40.000 records.
For more than 40.000 records, the internal structure of SQLMemTable starts to pay off with on the fly indexes.
That has also been shown in the C4D test. The C4D test has _not_ hidden any information, and is testing on equal terms
with SQLMemTable. If you have some properties you can set on the SQLMemTable to make it perform even better for that
test suite, then by all means use it and publish the result along with information about what the change was.
would not benefit tremendously from batched index updates. The amount of work needed is in the same ballpark as doing
- Modified their products for the better works on such "tests". They used
the updates on the fly.
kbmMemTable can benefit from batched index updates because it allows a much more efficient access to the TList
Both tests show how long time an enduser application employing those specific test algorithms would take, nothing more,
Well, let give us the arithmetic average time af each database operation, and
nothing less. The real life result is what the end user is seeing.
The best components for the best developers
kbmMW - kbmMemTable - kbmWABD - kbmX10