The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Identifier Search Mechanisms: A Survey and Generalized Model
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
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
Finding minimal perfect hash functions
SIGCSE '86 Proceedings of the seventeenth SIGCSE technical symposium on Computer science education
File organization using composite perfect hashing
ACM Transactions on Database Systems (TODS)
An Efficient Implementation of Static String Pattern Matching Machines
IEEE Transactions on Software Engineering
An Efficient Digital Search Algorithm by Using a Double-Array Structure
IEEE Transactions on Software Engineering
Fast hashing of variable-length text strings
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
Practical minimal perfect hash functions for large databases
Communications of the ACM
A modulus oriented hash function for the construction of minimal perfect tables
ACM SIGPLAN Notices
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Optimal signature extraction and information loss
ACM Transactions on Database Systems (TODS)
Domain vector hashing for earth system data querying
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Proceedings of the ninth international conference on Information and knowledge management
The study of an ordered minimal perfect hashing scheme
Communications of the ACM
Reciprocal hashing: a method for generating minimal perfect hashing functions
Communications of the ACM
Minimal perfect hash functions made simple
Communications of the ACM
Comments on perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
Communications of the ACM
Median split trees: a fast lookup technique for frequently occuring keys
Communications of the ACM
Minimal perfect hash functions for reserved word lists
ACM SIGPLAN Notices
Hash table methods for case statements
ACM-SE 20 Proceedings of the 20th annual Southeast regional conference
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
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
Design decisions influencing the microarchitecture for a Prolog machine
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
On the implementation of parsing tables
ACM SIGPLAN Notices
Efficient implementation of Aho–Corasick pattern matching automata using Unicode
Software—Practice & Experience
Efficient distributed subtyping tests
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Virtual hashing: a dynamically changing hashing
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Linear hashing: a new tool for file and table addressing
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Biosequence Similarity Search on the Mercury System
Journal of VLSI Signal Processing Systems
Perfect hash functions for large dictionaries
Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience
Extensible encoding of type hierarchies
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Perfect hashing as an almost perfect subtype test
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient hash-based searching for specimens in the museum's exhibit
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Empirical assessment of object-oriented implementations with multiple inheritance and static typing
Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications
| Hi-index | 48.36 |
A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered. Given a set I of identifiers, two methods are presented for building, in a mechanical way, perfect hashing functions, i.e. functions transforming the elements of I into unique addresses. The first method, the “quotient reduction” method, is shown to be complete in the sense that for every set I the smallest table in which the elements of I can be stored and from which they can be retrieved by using a perfect hashing function constructed by this method can be found. However, for nonuniformly distributed sets, this method can give rather sparse tables. The second method, the “remainder reduction” method, is not complete in the above sense, but it seems to give minimal (or almost minimal) tables for every kind of set. The two techniques are applicable directly to small sets. Some methods to extend these results to larger sets are also presented. A rough comparison with ordinary hashing is given which shows that this method can be used conveniently in several practical applications.