Commit graph

4 commits

Author SHA1 Message Date
Sears Russell
18c772234d new benchmarks revealed that inserts for linkedList, pageOrientedList were taking O(n) time, yielding O(n^2)
time to build a list, since the lists could not contain duplicate keys.  These operations are now O(1), and
the lists can contain duplicates.
2005-03-10 20:10:49 +00:00
Sears Russell
aead6a5a83 New benchmark, fixed for PROFILE_LATCHES. 2004-10-20 21:55:00 +00:00
Sears Russell
af9e7adee0 Starting work on the actual graph-generation portion of the benchmarks. :) 2004-10-20 06:21:21 +00:00
Sears Russell
ec1276f26f Preliminary version of logical logging linear hash. (No latching yet, and there are some bugs re-opening a closed hash.) 2004-10-18 18:24:54 +00:00