An analysis of random-walk cuckoo hashing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5687 LNCS, Issue , 2009, Pages 490-503

  Frieze, Alan ^a   Melsted, Páll ^a   Mitzenmacher, Michael ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Cuckoo hashing; Random walk algorithm

Indexed keywords

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

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL EFFICIENCY; LOCATION; TECHNICAL PRESENTATIONS;

APPROXIMATION ALGORITHMS;

EID: 70350399608     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_37     Document Type: Conference Paper

References (13)

1. Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced Allocations. SIAM Journal on Computing 29(1), 180-200 (1999)
2. Broder, A., Karlin, A.: Multilevel Adaptive Hashing. In: Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 43-53 (1990)
3. Broder, A., Mitzenmacher, M.: Using Multiple Hash Functions to Improve IP Lookups. In: Proceedings of the 20th IEEE International Conference on Computer Communications (INFOCOM), pp. 1454-1463 (2001)
4. Devroye, L., Morin, P.: Cuckoo Hashing: Further Analysis. Information Processing Letters 86(4), 215-219 (2003)
5. Dietzfelbinger, M.,Weidling, C.: Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins. Theoretical Computer Science 380(1-2), 47-68 (2007)
6. Fotakis, D., Pagh, R., Sanders, P., Spirakis, P.: Space Efficient Hash Tables With Worst Case Constant Access Time. Theory of Computing Systems 38(2), 229-248 (2005)
7. Kirsch, A., Mitzenmacher, M.: Using a Queue to De-amortize Cuckoo Hashing in Hardware. In: Proceedings of the Forty-Fifth Annual Allerton Conference on Communication, Control, and Computing (2007)
8. Kirsch, A., Mitzenmacher, M., Wieder, U.: More Robust Hashing: Cuckoo Hashing with a Stash. In: Proceedings of the 16th Annual European Symposium on Algorithms, pp. 611-622 (2008)
9. Kirsch, A., Mitzenmacher, M.: The Power of One Move: Hashing Schemes for Hardware. In: Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM), pp. 565-573 (2008)
10. Kutzelnigg, R.: Bipartite Random Graphs and Cuckoo Hashing. In: Proceedings of the Fourth Colloquium on Mathematics and Computer Science (2006)
11. Mitzenmacher, M., Vadhan, S.: 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), pp. 746-755 (2008)
12. Pagh, R., Rodler, F.: Cuckoo Hashing. Journal of Algorithms 51(2), 122-144 (2004)
13. Vöcking, B.: How Asymmetry Helps Load Balancing. Journal of the ACM 50(4), 568-589 (2003)