Minimal perfect hash functions made simple
Communications of the ACM
Perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
The external language KLIPA for the URAL-2 digital computer
Communications of the ACM
Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
A polynomial time generator for minimal perfect hash functions
Communications of the ACM
File organization using composite perfect hashing
ACM Transactions on Database Systems (TODS)
A more cost effective algorithm for finding perfect hash functions
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
An Efficient Digital Search Algorithm by Using a Double-Array Structure
IEEE Transactions on Software Engineering
A compendium of key search references
ACM SIGIR Forum
Practical minimal perfect hash functions for large databases
Communications of the ACM
A faster algorithm for constructing minimal perfect hash functions
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
A modulus oriented hash function for the construction of minimal perfect tables
ACM SIGPLAN Notices
An undergraduate project to compute minimal perfect hashing functions
ACM SIGCSE Bulletin
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Optimal signature extraction and information loss
ACM Transactions on Database Systems (TODS)
Communications of the ACM
Communications of the ACM
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Proceedings of the ninth international conference on Information and knowledge management
The study of an ordered minimal perfect hashing scheme
Communications of the ACM
Minimal perfect hash functions for reserved word lists
ACM SIGPLAN Notices
Using Tries to Eliminate Pattern Collisions in Perfect Hashing
IEEE Transactions on Knowledge and Data Engineering
A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
A letter oriented minimal perfect hashing function
ACM SIGPLAN Notices
Perfect hash functions for large dictionaries
Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience
An efficient hash-based searching for specimens in the museum's exhibit
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
| Hi-index | 48.30 |
A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets. A proof of existence for minimal perfect hash functions of a special type (reciprocal type) is given. Two algorithms for determining hash functions of reciprocal type are presented and their practical limitations are discussed. Further, some application results are given and compared with those of earlier approaches for perfect hashing.