Chapter

Algorithms — ESA 2001

Volume 2161 of the series Lecture Notes in Computer Science pp 121-133

Date:

Cuckoo Hashing

  • Rasmus PaghAffiliated withBRICS Department of Computer Science, University of Aarhus
  • , Flemming Friche RodlerAffiliated withBRICS Department of Computer Science, University of Aarhus

* Final gross prices may vary according to local VAT.

Get Access

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.