DZone voters are special people. Be special. Login and vote now.
By CodeJustin
via eigenclass.org
Published: Jul 04 2009 / 18:19
In my earlier finite map benchmarks which compared several hash tables and functional maps (AVL trees and ternary trees), separate chaining (with $$\alpha = 0.47$$) beat double hashing ($$\alpha = 0.42$$) at unsuccessful searches (1% hit rate), but was slower at successful ones.
Theory predicts the following average number of probes for unsuccessful and successful lookups (expressions below):
Comments
MCII replied ago:
separate-chaining - for in memory hash tables
double-hashing - for hash tables in files
Voters For This Link (5)
Voters Against This Link (1)