Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
A guided tour of Chernoff bounds
Information Processing Letters
A reliable randomized algorithm for the closest-pair problem
Journal of Algorithms
On the cell probe complexity of membership and perfect hashing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Cuckoo hashing: further analysis
Information Processing Letters
Journal of Algorithms
Linear probing with constant independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
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
On risks of using cuckoo hashing with simple universal hash classes
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
High throughput heavy hitter aggregation for modern SIMD processors
Proceedings of the Ninth International Workshop on Data Management on New Hardware
| Hi-index | 0.00 |
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T 1 and T 2 each of which has m cells of capacity 1 such that constant access time is guaranteed. For m ≥ (1 + ε)n and hash functions h 1, h 2 that are c logn-wise independent, Pagh [11] showed that the keys of an arbitrary set S can be stored using h 1 and h 2 with a probability of 1 − O(1/n). Here we prove that a family of simple hash functions that can be evaluated fast is not sufficient to guarantee this behavior, namely there exists a “bad” set S of size ≅ (7/8) ·m for which the probability that the keys of S cannot be stored using h 1 and h 2 is Ω(1). Experiments indicate that the bad sets cause the cuckoo scheme to fail with a probability much larger than formally proved in our main theorem. Our result shows that care must be taken when using cuckoo hashing in combination with very simple hash classes, if a small failure probability is essential since frequent rehashing cannot be tolerated.