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. © Springer-Verlag Berlin Heidelberg 2001.
CITATION STYLE
Pagh, R., & Rodler, F. F. (2001). Cuckoo hashing. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2161, 121–133. https://doi.org/10.1007/3-540-44676-1_10
Mendeley helps you to discover research relevant for your work.