Affiliation:
1. St. Michael's College, Colchester, VT
Abstract
This paper will discuss improvements to Cichelli's method for computing the set of weights used for minimal perfect hashing functions[1]. The major modifications investigated here pertain to adding a "MOD number_of_keys" operation to the hashing function, and to the removal of unnecessary backtracking due to "guaranteed collisions".
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference8 articles.
1. [
1
] Minimal Perfect Hashing Functions Made Simple Cichelli. Communications of the ACM Volume 23 #1 1980. 10.1145/358808.358813 [1] Minimal Perfect Hashing Functions Made Simple Cichelli. Communications of the ACM Volume 23 #1 1980. 10.1145/358808.358813
2. [
2
] A Letter Oriented Minimal Perfect Hashing Function Cook and Oldehoeft. ACM SIGPLAN Notices Volume 17 #9 1982. 10.1145/947955.947957 [2] A Letter Oriented Minimal Perfect Hashing Function Cook and Oldehoeft. ACM SIGPLAN Notices Volume 17 #9 1982. 10.1145/947955.947957
3. [
3
] Hashing for Dynamic and Static Internal Tables Lewis and Cook. IEEE Computer October 1988. 10.1109/2.7056 [3] Hashing for Dynamic and Static Internal Tables Lewis and Cook. IEEE Computer October 1988. 10.1109/2.7056
4. [
4
] Practical Minimal Perfect Hash Functions for Large Databases Fox Heath Chen and Daoud. Communications of the ACM Volume 35 #1 1992. 10.1145/129617.129623 [4] Practical Minimal Perfect Hash Functions for Large Databases Fox Heath Chen and Daoud. Communications of the ACM Volume 35 #1 1992. 10.1145/129617.129623
5. [
5
] An Undergraduate Project to Compute Minimal Perfect Hashing Functions Trono. SIGCSE Bulletin Volume 24 #3 1992. 10.1145/142040.142077 [5] An Undergraduate Project to Compute Minimal Perfect Hashing Functions Trono. SIGCSE Bulletin Volume 24 #3 1992. 10.1145/142040.142077