This paper deals with hash tables in which conflicts are resolved by open addressing. The initial contribution is a very simple insertion procedure which (in comparison to the standard approach) has the effect of dramatically reducing the variance of the number of probes required for a search. This leads to a new search procedure which requires only a constant number of probes, on average, even for full tables. Finally, an extension to these methods yields a new, simple way of performing deletions and subsequent insertions. Experimental results strongly indicate little degeneration in search time. In particular deletions and successful searches appear to require constant time (≪ 2.57 probes) and insertions and unsuccessful searches, O(logn).
[1]
Richard P. Brent,et al.
Reducing the retrieval time of scatter storage techniques
,
1973,
Commun. ACM.
[2]
Efrem G. Mallach.
Scatter Storage Techniques: A Unifying Viewpoint and a Method for Reducing Retrieval Times
,
1977,
Comput. J..
[3]
Ronald L. Rivest.
Optimal Arrangement of Keys in a Hash Table
,
1978,
JACM.
[4]
Gaston H. Gonnet,et al.
Efficient Ordering of Hash Tables
,
1979,
SIAM J. Comput..
[5]
Gaston H. Gonnet,et al.
Expected Length of the Longest Probe Sequence in Hash Code Searching
,
1981,
JACM.