SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
SIAM Journal on Computing
Cuckoo hashing: further analysis
Information Processing Letters
How asymmetry helps load balancing
Journal of the ACM (JACM)
Journal of Algorithms
Balanced allocation and dictionaries with tightly packed constant size bins
Theoretical Computer Science
Why simple hash functions work: exploiting the entropy in a data stream
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
More Robust Hashing: Cuckoo Hashing with a Stash
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Sharp load thresholds for cuckoo hashing
Random Structures & Algorithms
| Hi-index | 0.00 |
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 provides a useful methodology for building practical, high-performance hash tables. The essential idea of cuckoo hashing is to combine the power of schemes that allow multiple hash locations for an item with the power to dynamically change the location of an item among its possible locations. Previous work on the case where the number of choices is larger than two has analyzed breadth-first search, which is both inefficient in practice and currently has only a polynomial upper bound on the insertion time that holds with high probability. On the other hand, it does have expected constant amortized insertion time. Here we significantly advance the state of the art by proving a polylogarithmic bound that holds with high probability on the more efficient random-walk method, where items repeatedly kick out random blocking items until a free location for an item is found.