Abstract
We generalize Cuckoo Hashing to d-ary Cuckoo Hashing and show how this yields a simple hash table data structure that stores n elements in (1 + ε)n memory cells, for any constant ε > 0. Assuming uniform hashing, accessing or deleting table entries takes at most d=O (ln (1/ε)) probes and the expected amortized insertion time is constant. This is the first dictionary that has worst case constant access time and expected constant update time, works with (1 + ε)n space, and supports satellite information. Experiments indicate that d = 4 probes suffice for ε ≈ 0.03. We also describe variants of the data structure that allow the use of hash functions that can be evaluated in constant time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Fotakis, D., Pagh, R., Sanders, P. et al. Space Efficient Hash Tables with Worst Case Constant Access Time. Theory Comput Syst 38, 229–248 (2005). https://doi.org/10.1007/s00224-004-1195-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-004-1195-x