Almost random graphs with simple hash functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cuckoo hashing: further analysis
Information Processing Letters
Journal of Algorithms
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Balanced allocation and dictionaries with tightly packed constant size bins
Theoretical Computer Science
History-Independent Cuckoo Hashing
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
More Robust Hashing: Cuckoo Hashing with a Stash
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
More Robust Hashing: Cuckoo Hashing with a Stash
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
An Analysis of Random-Walk Cuckoo Hashing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Fast and compact hash tables for integer keys
ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
More Robust Hashing: Cuckoo Hashing with a Stash
SIAM Journal on Computing
An Analysis of Random-Walk Cuckoo Hashing
SIAM Journal on Computing
On the (in)security of hash-based oblivious RAM and a new balancing scheme
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A precise analysis of Cuckoo hashing
ACM Transactions on Algorithms (TALG)
On the vulnerability of hardware hash tables to sophisticated attacks
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Explicit and efficient hash families suffice for cuckoo hashing with a stash
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Access-efficient Balanced Bloom Filters
Computer Communications
Distributed oblivious RAM for secure two-party computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
| Hi-index | 0.00 |
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 is a polynomially small but practically significant probability that a failure occurs during the insertion of an item, requiring an expensive rehashing of all items in the table. In this paper, we show that this failure probability can be dramatically reduced by the addition of a very small constant-sized stash. We demonstrate both analytically and through simulations that stashes of size equivalent to only three or four items yield tremendous improvements, enhancing cuckoo hashing's practical viability in both hardware and software. Our analysis naturally extends previous analyses of multiple cuckoo hashing variants, and the approach may prove useful in further related schemes.