The study of an ordered minimal perfect hashing scheme

We propose a new minimal perfect hashing scheme based upon the Chinese Remainder Theorem and prime number functions. The keys can be stored in ascending order by applying our hashing function. An algorithm to determine an important parameter for this hashing function is also presented.

[1]  Sakti P. Ghosh.  Data base organization for data management , 1977 .

[2]  Calvin T. Long,et al.  Elementary introduction to number theory , 1965 .

[3]  Gerhard Jaeschke.  Reciprocal hashing: a method for generating minimal perfect hashing functions , 1981, CACM.

[4]  Werner Buchholz,et al.  File Organization and Addressing , 1963, IBM Syst. J..

[5]  Renzo Sprugnoli,et al.  Perfect hashing functions , 1977, Commun. ACM.

[6]  Ted G. Lewis,et al.  Hash Table Methods , 1975, CSUR.

[7]  W. W. Peterson,et al.  Addressing for Random-Access Storage , 1957, IBM J. Res. Dev..

[8]  Curtis R. Cook,et al.  A letter oriented minimal perfect hashing function , 1982, SIGP.

[9]  Robert H. Morris,et al.  Scatter storage techniques , 1983, CACM.

[10]  Vincent Y. Lum,et al.  Key-to-address transform techniques: a fundamental performance study on large existing formatted files , 1971, CACM.

[11]  Richard J. Cichelli.  Minimal perfect hash functions made simple , 1980, CACM.

[12]  Wacław Sierpiński.  A Selection of Problems in the Theory of Numbers , 1964 .

[13]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[14]  H. M. Stark,et al.  An introduction to number theory , 1978 .

[15]  M. Tainiter,et al.  Addressing for Random-Access Storage with Multiple Bucket Capacities , 1963, JACM.

[16]  Charles A. Olson.  Random access file organization for indirectly addressed records , 1969, ACM '69.

[17]  Dennis G. Severance,et al.  Identifier Search Mechanisms: A Survey and Generalized Model , 1974, CSUR.

[18]  Wilhelm G. Spruth,et al.  Analysis of a file addressing method , 1962, Commun. ACM.

[19]  L. R. Johnson,et al.  An indirect chaining method for addressing on secondary keys , 1961, CACM.

[20]  M. W. Du,et al.  The Study of a New Perfect Hash Scheme , 1983, IEEE Transactions on Software Engineering.