A scheme for constructing ordered minimal perfect hashing functions

This paper describes a method to be used for the organization and retrieving data. Jaeschke proposed the function h(k) = [C(Dk + E)] mod n, where n is the size of a given key set, for constructing minimal perfect hashing functions. We propose another minimal perfect hashing scheme based upon number theory, with the function h(k) = [CT(k)] mod n. The keys can be stored in ascending order by applying this hashing function. A straightforward method to calculate the important parameter C is presented.

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

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

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

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

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

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

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

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

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

[10]  W. D. Maurer,et al.  An improved hash code for scatter storage , 1983, CACM.

[11]  C. C. Chang.  The study of an ordered minimal perfect hashing scheme , 1984, CACM.

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

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

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

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

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

[17]  Ward Douglas Maurer.  Programming Technique: An improved hash code for scatter storage , 1968, CACM.

[18]  Chin-Chen Chang.  An ordered minimal perfect hashing scheme based upon Euler's theorem , 1984, Inf. Sci..

[19]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .