11 search results - page 1 / 3 » An Analysis of Random-Walk Cuckoo Hashing |
APPROX
2009
Springer
13 years 10 months ago
2009
Springer
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing ...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Cuckoo hashing holds great potential as a high-performance hashing scheme for real applications. Up to this point, the greatest drawback of cuckoo hashing appears to be that there...
ESA
2009
Springer
13 years 10 months ago
2009
Springer
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...