An analysis of random-walk cuckoo hashing

SIAM Journal on Computing

Volumn 40, Issue 2, 2011, Pages 291-308

  Frieze, Alan ^a   Melsted, Ṕall ^a   Mitzenmacher, Michael ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Cuckoo; Hashing; Random walk

Indexed keywords

BREADTH-FIRST SEARCH; CUCKOO; HASH TABLE; HASHING; HIGH PROBABILITY; INSERTION METHODS; POLYLOGARITHMIC; RANDOM WALK; RANDOM-WALK METHOD; STATE OF THE ART; UPPER BOUND;

PROBABILITY;

EID: 79957441951     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090770928     Document Type: Article

References (14)

1. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal, Balanced allocations, SIAM J. Comput., 29 (1999), pp. 180-200. (Pubitemid 30588356)
2. A. Broder and A. Karlin, Multilevel adaptive hashing, in Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA), 1990, pp. 43-53.
3. A. Broder and M. Mitzenmacher, Using multiple hash functions to improve IP lookups, in Proceedings of the 20th IEEE International Conference on Computer Communications (INFOCOM), 2001, pp. 1454-1463. (Pubitemid 32485792)
4. L. Devroye and P. Morin, Cuckoo hashing: Further analysis, Inform. Process. Lett., 86 (2003), pp. 215-219.
5. M. Dietzfelbinger and C. Weidling, Balanced allocation and dictionaries with tightly packed constant size bins, Theoret. Comput. Sci., 380 (2007), pp. 47-68. (Pubitemid 46754593)
6. D. Fotakis, R. Pagh, P. Sanders, and P. Spirakis, Space efficient hash tables with worst case constant access time, Theory Comput. Syst., 38 (2005), pp. 229-248. (Pubitemid 41201577)
7. N. Fountoulakis, K. Panagioutou, and A. Steger, On the Insertion Time of Cuckoo Hashing, arXiv:1006.1231.
8. A. Kirsch and M. Mitzenmacher, Using a queue to de-amortize cuckoo hashing in hardware, in Proceedings of the 45th Annual Allerton Conference on Communication, Control, and Computing, 2007, pp. 751-758.
9. A. Kirsch and M. Mitzenmacher, The power of one move: Hashing schemes for hardware, in Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM), 2008, pp. 565-573.
10. A. Kirsch, M. Mitzenmacher, and U. Wieder, More robust hashing: Cuckoo hashing with a stash, in Proceedings of the 16th Annual European Symposium on Algorithms, 2008, pp. 611-622.
11. R. Kutzelnigg, Bipartite random graphs and cuckoo hashing, in Proceedings of the Fourth Colloquium on Mathematics and Computer Science, 2006, pp. 403-406.
12. M. Mitzenmacher and S. Vadhan, Why simple hash functions work: Exploiting the entropy in a data stream, in Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2008, pp. 746-755.
13. R. Pagh and F. Rodler, Cuckoo hashing, J. Algorithms, 51 (2004), pp. 122-144.
14. B. Vöcking, How asymmetry helps load balancing, J. ACM, 50 (2003), pp. 568-589. (Pubitemid 43906338)