An Improved Program for Constructing Open Hash Tables

Cuckoo hashing is a hash table data structure introduced in [1], that offers constant worst case search time. As a major contribution of this paper, we analyse modified versions of this algorithm with improved performance. Further, we provide an asymptotic analysis of the search costs of all this variants of cuckoo hashing and compare this results with the well known properties of double hashing and linear probing. The analysis is supported by numerical results. Finally, our analysis shows, that the expected number of steps of search operations can be reduced by using a modified version of cuckoo hashing instead of standard algorithms based on open addressing.

[1]  Leonidas J. Guibas,et al.  The Analysis of Double Hashing , 1978, J. Comput. Syst. Sci..

[2]  Gaston H. Gonnet,et al.  The analysis of an improved hashing technique , 1977, STOC '77.

[3]  W. Feller,et al.  An Introduction to Probability Theory and Its Application. , 1951 .

[4]  I. Good.  Saddle-point Methods for the Multinomial Distribution , 1957 .

[5]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[6]  János Komlós,et al.  There is no Fast Single Hashing Algorithm , 1978, Inf. Process. Lett..

[7]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[8]  Ronald L. Rivest.  Optimal Arrangement of Keys in a Hash Table , 1978, JACM.

[9]  C. J. Park.  Random Allocations (Valentin F. Kolchin, Boris A. Sevast’yanov and Vladimir P. Chistyakov) , 1980 .

[10]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[11]  Donald E. Knuth,et al.  Computer Science and its Relation to Mathematics , 1974 .

[12]  Richard P. Brent,et al.  Reducing the retrieval time of scatter storage techniques , 1973, Commun. ACM.

[13]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[14]  Gaston H. Gonnet,et al.  Efficient Ordering of Hash Tables , 1979, SIAM J. Comput..

[15]  Robert E. Tarjan,et al.  Storing a sparse table , 1979, CACM.

[16]  W. Donath.  Algorithm and average-value bounds for assignment problems , 1969 .

[17]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[18]  David W. Walkup,et al.  On the Expected Value of a Random Assignment Problem , 1979, SIAM J. Comput..