Deterministic hash table benchmarks
jason.orendorff at gmail.com
Fri Feb 24 10:43:37 PST 2012
I wrote a benchmark and tested an implementation of Tyler Close's
deterministic hash table against some conventional, non-deterministic
Tyler Close's table is faster, but it uses more memory.
Details and graphs:
These results are very raw. Take a look at the code. See if there are
simple ways to improve the performance of either hash table. Or
explain to me why CloseTable is faster even though it's doing more
work. Or why the DeleteTest results are so weird.
More information about the es-discuss