A scheme for constructing ordered minimal perfect hashing functions
References (20)
An ordered minimal perfect hashing scheme based upon Euler's theorem
Inform. Sci.
(June 1984)File organization and addressing
IBM Systems J.
(June 1963)The study of an ordered minimal perfect hashing scheme
Comm. ACM
(Apr. 1984)Minimal perfect hash functions made simple
Comm. ACM
(Jan. 1980)- et al.
A letter oriented minimal perfect hashing function
Sigplan Notices
(Sept. 1982) - et al.
The study of a new perfect hash scheme
IEEE Trans. Software Engrg.
(May 1983) Data Base Organization for Data Management
Reciprocal hashing: A method for generating minimal perfect hashing functions
Comm. ACM
(Dec. 1981)An indirect chaining method for addressing on secondary keys
Comm. ACM
(May 1981)Sorting and Searching
There are more references available in the full text version of this article.
Cited by (5)
Empirical studies of some hashing functions
2003, Information and Software TechnologyThe study of letter-oriented hashing schemes
1995, The Journal of Systems and SoftwareResearch on hash algorithm for retrieval of global multi-resolution terrain cache data
2010, ICALIP 2010 - 2010 International Conference on Audio, Language and Image Processing, ProceedingsPerfect hashing schemes for mining traversal patterns
2006, Fundamenta InformaticaePerfect hashing schemes for mining association rules
2005, Computer Journal
Copyright © 1986 Published by Elsevier Inc.