A scheme for constructing ordered minimal perfect hashing functions

doi:10.1016/0020-0255(86)90033-2

Information Sciences

Volume 39, Issue 2, September 1986, Pages 187-195

https://doi.org/10.1016/0020-0255(86)90033-2 Get rights and content

Abstract

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) = [C T(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.

References (20)

C.C. Chang
An ordered minimal perfect hashing scheme based upon Euler's theorem
Inform. Sci.
(June 1984)
W. Buchholz
File organization and addressing
IBM Systems J.
(June 1963)
C.C. Chang
The study of an ordered minimal perfect hashing scheme
Comm. ACM
(Apr. 1984)
R.J. Cichelli
Minimal perfect hash functions made simple
Comm. ACM
(Jan. 1980)
C.R. Cook et al.
A letter oriented minimal perfect hashing function
Sigplan Notices
(Sept. 1982)
M.W. Du et al.
The study of a new perfect hash scheme
IEEE Trans. Software Engrg.
(May 1983)
S.P. Ghosh
Data Base Organization for Data Management
G. Jaeschke
Reciprocal hashing: A method for generating minimal perfect hashing functions
Comm. ACM
(Dec. 1981)
L.R. Johnson
An indirect chaining method for addressing on secondary keys
Comm. ACM
(May 1981)
D.E. Knuth
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 Technology
The best hash function for a particular data set can often be found by empirical studies. The studies reported here are aimed at discovering the most appropriate function for hashing Nigerian names. Five common hash functions—the division, multiplication, midsquare, radix conversion and random methods—along with two collision—handling techniques—linear probing and chaining—were initially tried out on three data sets, each consisting of about 1000 words. The first data set consists of Nigerian names, the second of English names, and the third of words with computing associations. The major finding is that the performance of these functions with the Nigerian names is comparable to those for the other data sets. Also, the superiority of the random and division methods over others is confirmed, even though the division method will often be preferred for its ease of computation. It is also demonstrated that chaining, as a technique for collision-handling, is to be preferred. The hash methods and collision-handling methods were further tested by using much larger data sets and long multiple word strings. These further tests confirmed the previous findings.
The study of letter-oriented hashing schemes
1995, The Journal of Systems and Software
This article proposes two minimal perfect hashing schemes suitable for letter-oriented keys. One is based on the Chinese remainder theorem, and the other is based on Ghosh's rank-hashing function. The most significant advantages of these two schemes are that it is not necessary to arrange the extracted character pairs in their lexical order, the extraction job can be done by computer (an algorithm for automatic extraction is proposed here to solve this problem), the extraction can be extended from character pairs to character triplets, quartets, or quintets such that the occurrence of key collision may decrease or even not occur, and both schemes can handle a very large number of letter-oriented keys.
Research on hash algorithm for retrieval of global multi-resolution terrain cache data
2010, ICALIP 2010 - 2010 International Conference on Audio, Language and Image Processing, Proceedings
Perfect hashing schemes for mining traversal patterns
2006, Fundamenta Informaticae
Perfect hashing schemes for mining association rules
2005, Computer Journal

View full text

A scheme for constructing ordered minimal perfect hashing functions

Abstract

Inform. Sci.

File organization and addressing

IBM Systems J.

The study of an ordered minimal perfect hashing scheme

Comm. ACM

Minimal perfect hash functions made simple

Comm. ACM

A letter oriented minimal perfect hashing function

Sigplan Notices

The study of a new perfect hash scheme

IEEE Trans. Software Engrg.

Data Base Organization for Data Management

Reciprocal hashing: A method for generating minimal perfect hashing functions

Comm. ACM

An indirect chaining method for addressing on secondary keys

Comm. ACM

Sorting and Searching