From: Alex B. <boi...@in...> - 2001-06-03 02:34:27
|
Eric, (I'm also CC:'ing the JDBM mailing list) You question about JDBM's performance picked my curiosity. So, just for fun, I generated a B+Tree containing 10 million simple objects (java.lang.Long for both key and value). After that, I queried the database for 1000 random numbers. It turns out the average lookup time for a random object in the B+Tree was approx 30-40 milliseconds with a cold cache. You mileage may vary, depending on the size of your objects, the complexity of serialization and the cost of comparing objects for ordering. In any case, it should give you an order of magnitude for JDBM's performance. I ran the test on my Dell laptop (P3/700Mhz/256RAM) on Win2K with Sun's JDK 1.3. If you're interested, I can send you the source for the test (or even add it to the JDBM distribution). cheers, alex -- Alex Boisvert boi...@in... Project Manager, Intalio Inc. www.intalio.com Operate at the Process Level <SM> (650) 345 2777 |