ALCOMFT-TR-01-124

Rasmus Pagh and Flemming Friche Rodler
Cuckoo Hashing
Århus. Work packages 4 and 5. May 2001.

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.

Postscript file: ALCOMFT-TR-01-124.ps.gz (107 kb).