Sears Russell
71292538e8
Amortize bucket initialization costs for linear hash tables. The best case improvement (~ 20%) is seen with hashes with fixed length key/value pairs and insert-only workloads
2010-05-12 17:51:20 +00:00
Sears Russell
250223086c
reordered includes for compatibility with gcc3
2010-01-21 00:03:17 +00:00
no author
d0274c3304
Renamed 'lladd' directories and python module to 'stasis'
2007-06-11 21:36:57 +00:00
Sears Russell
ef3c30b190
Benchmark updates.
2005-03-20 05:17:25 +00:00
Sears Russell
1bfb634103
Preliminary benchmark program uploads for SEDA-style response time percentiles vs requests / second
...
Also added a few cute little utilities:
- truncate_log
- run_recovery
Upped max # of concurrent transactions. (Current throughput during benchmarking remains ~flat up to 32,000
threads, but past max concurrent transactions was 1,000...)
2005-03-12 22:11:18 +00:00
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
