European Symposium on Algorithms

ESA 2001: Algorithms — ESA 2001 pp 121-133

Cuckoo Hashing

  • Rasmus Pagh
  • Flemming Friche Rodler
Conference paper

DOI: 10.1007/3-540-44676-1_10

Volume 2161 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Pagh R., Rodler F.F. (2001) Cuckoo Hashing. In: auf der Heide F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg

Abstract

We present a simple and efficient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of the scheme is backed by extensive experiments and comparisons with known methods, showing it to be quite competitive also in the average case.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Rasmus Pagh
    • 1
  • Flemming Friche Rodler
    • 1
  1. 1.BRICS Department of Computer ScienceUniversity of AarhusDenmark