Changes

Jump to: navigation, search

User:Jorend/Deterministic hash tables

210 bytes added, 04:30, 23 February 2012
Results
[[Image:jorendorff-dht-figure-1.png]]
 
All three implementations double the size of the table whenever it gets too full. On a log-log plot, this shows as stair-steps of a constant height. The slope of each staircase is 1, indicating linear growth.
CloseTable is much more memory-efficient than DenseTable, because the latter is tuned for fast lookups at all costs.
638
edits

Navigation menu