Abstract
Purchase PDF (327 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (21)
Purchase PDF (195 K)
doi:10.1016/j.jalgor.2003.12.002 
Copyright © 2003 Elsevier Inc. All rights reserved.
Cuckoo hashing
Received 23 January 2002.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We present a simple dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. [SIAM J. Comput. 23 (4) (1994) 738–761]. The space usage is similar to that of binary search trees. Besides being conceptually much simpler than previous dynamic dictionaries with worst case constant lookup time, our data structure is interesting in that it does not use perfect hashing, but rather a variant of open addressing where keys can be moved back in their probe sequences. An implementation inspired by our algorithm, but using weaker hash functions, is found to be quite practical. It is competitive with the best known dictionaries having an average case (but no nontrivial worst case) guarantee on lookup time.
Author Keywords: Data structures; Dictionaries; Information retrieval; Searching; Hashing; Experiments
