Skip to main content
SpringerLink
Log in

Some Open Questions Related to Cuckoo Hashing

  • Conference paper
Algorithms - ESA 2009 (ESA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5757))

Included in the following conference series:

Abstract

The purpose of this brief note is to describe recent work in the area of cuckoo hashing, including a clear description of several open problems, with the hope of spurring further research.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adler, M., Chakrabarti, S., Mitzenmacher, M., Rasmussen, L.: Parallel randomized load balancing. In: Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, pp. 238–247 (1995)

    Google Scholar 

  2. Alcantara, D., Sharf, A., Abbasinejad, F., Amenta, N., Mitzenmacher, M., Owens, J., Sengupta, S.: Real-time parallel hashing on the GPU (submitted)

    Google Scholar 

  3. Arbitman, Y., Naor, M., Segev, G.: De-amortized cuckoo hashing: provable worst-case performance and experimental results. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. Part I. LNCS, vol. 5555, pp. 107–118. Springer, Heidelberg (2009)

    Google Scholar 

  4. Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced allocations. SIAM Journal of Computing 29(1), 180–200 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Batu, T., Berenbrink, P., Cooper, C.: Balanced allocations: Balls-into-bins revisited and chains-into-bins. CDAM Research Report LSE-CDAM-2007-34

    Google Scholar 

  6. Braverman, M.: Poly-logarithmic independence fools AC0 circuits. To appear in Proceedings of the 24th Annual IEEE Conference on Computational Complexity (2009)

    Google Scholar 

  7. Broder, A., Mitzenmacher, M.: Using multiple hash functions to improve IP Lookups. In: Proceedings of IEEE INFOCOM, pp. 1454–1463 (2001)

    Google Scholar 

  8. Cain, J., Sanders, P., Wormald, N.: The random graph threshold for k-orientability and a fast algorithm for optimal multiple-choice allocation. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 469–476 (2007)

    Google Scholar 

  9. Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences 18(2), 143–154 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  10. Chung, K.M., Vadhan, S.: Tight bounds for hashing block sources. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol. 5171, pp. 357–370. Springer, Heidelberg (2008)

    Google Scholar 

  11. Cohen, J., Kane, D.: Bounds on the independence required for cuckoo hashing (preprint)

    Google Scholar 

  12. Dalal, K., Devroye, L., Malalla, E., McLeish, E.: Two-way chaining with reassignment. SIAM Journal on Computing 35, 327–340 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Dietzfelbinger, M., Meyer auf der Heide, F.: An optimal parallel dictionary. Information and Computation 102(2), 196–217 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dietzfelbinger, M., Meyer auf der Heide, F.: Simple, efficient shared memory simulations. In: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 110–119 (1993)

    Google Scholar 

  15. Dietzfelbinger, M., Pagh, R.: Succinct data structures for retrieval and approximate membership (Extended abstract). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 385–396. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Dietzfelbinger, M., Schellbach, U.: On risks of using cuckoo hashing with simple universal hash classes. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 795–804 (2009)

    Google Scholar 

  17. Dietzfelbinger, M., Weidling, C.: Balanced allocation and dictionaries with tightly packed constant size bins. Theoretical Computer Science 380(1-2), 47–68 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  18. Fernholz, D., Ramachandran, V.: The k-orientability thresholds for G n,p . In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 459–468 (2007)

    Google Scholar 

  19. 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)

    Article  MathSciNet  MATH  Google Scholar 

  20. Fredman, M., Komlós, J., Szemerédi, E.: Stoaring a sparse table with O(1) worst case access time. Journal of the Association of Computing Machinery 31(3), 538–544 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  21. Frieze, A., Melsted, P., Mitzenmacher, M.: An analysis of random-walk cuckoo hashing. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009 and RANDOM 2009. LNCS, vol. 5687, pp. 490–503. Springer, Heidelberg (2009)

    Google Scholar 

  22. Gonnet, G.: Expected length of the longest probe sequence in hash code searching. Journal of the Association for Computing Machinery 28(2), 289–304 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  23. Karp, R., Luby, M., Meyer, F., Meyer auf der Heide, F.: Efficient PRAM simulation on a distributed memory machine. Algorithmica 16(4), 517–542 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  24. 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)

    Google Scholar 

  25. 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. 106–110 (2008)

    Google Scholar 

  26. Kirsch, A., Mitzenmacher, M., Wieder, U.: More robust hashing: Cuckoo hashing with a stash. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 611–622. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  27. Kirsch, A., Mitzenmacher, M., Varghese, G.: Hash-based techniques for high-speed packet processing. Preprint, to appear in Algorithms for Next Generation Networks. Springer, Heidelberg (2009)

    Google Scholar 

  28. Knuth, D.: The Art of Computer Programming, Sorting and Searching, vol. 3. Addison-Wesley, Reading (1973)

    MATH  Google Scholar 

  29. Kutzelnigg, R.: Bipartite random graphs and cuckoo hashing. In: Proceedings of the Fourth Colloquium on Mathematics and Computer Science (2006)

    Google Scholar 

  30. Mitzenmacher, M., Richa, A., Sitaraman, R.: The power of two choices: a survey of techniques and results. In: Pardalos, P., Rajasekaran, S., Reif, J., Rolim, J. (eds.) Handbook of Randomized Computing, pp. 255–312. Kluwer Academic Publishers, Norwell (2001)

    Chapter  Google Scholar 

  31. MacKenzie, P., Plaxton, C.G., Rajaraman, R.: On contention resolution protocols and associated probabilistic phenomena. Journal of the ACM 45(2), 324–378 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  32. 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)

    Google Scholar 

  33. Naor, M., Segev, G., Wieder, U.: History-Independent Cuckoo Hashing. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 631–642. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  34. Pagh, A., Rodler, F.: Cuckoo hashing. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 121–133. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  35. Pagh, A., Rodler, F.: Cuckoo hashing. Journal of Algorithms 51(2), 122–144 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  36. Porat, E.: An optimal Bloom filter replacement based on matrix solving. Technical report, arxiv:0804.1845v1 [cs.DS] (April 2008)

    Google Scholar 

  37. Siegel, A.: On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp. 20–25 (1989)

    Google Scholar 

  38. Vöcking, B.: How asymmetry helps load balancing. Journal of the ACM 50(4), 568–589 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, 02138

    Michael Mitzenmacher

Authors
  1. Michael Mitzenmacher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Tel Aviv University, Tel Aviv, Israel

    Amos Fiat

  2. Fakultät für Informatik, Universität Karlsruhe (TH), Am Fasanengarten 5, 76131, Karlsruhe, Germany

    Peter Sanders

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mitzenmacher, M. (2009). Some Open Questions Related to Cuckoo Hashing. In: Fiat, A., Sanders, P. (eds) Algorithms - ESA 2009. ESA 2009. Lecture Notes in Computer Science, vol 5757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04128-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04128-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04127-3

  • Online ISBN: 978-3-642-04128-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation