A polynomial time generator for minimal perfect hash functions
Communications of the ACM
Mathematical statistics (4th ed.)
Mathematical statistics (4th ed.)
Introduction to operations research, 4th ed.
Introduction to operations research, 4th ed.
External hashing with limited internal storage
Journal of the ACM (JACM)
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Analysis of bounded disorder file organization
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Journal of the ACM (JACM)
Communications of the ACM
File organization: implementation of a method guaranteeing retrieval in one access
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
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
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The program complexity of searching a table (data structures, applied combinatorics)
The program complexity of searching a table (data structures, applied combinatorics)
Perfect hashing for external files
Perfect hashing for external files
Hashing practice: analysis of hashing and universal hashing
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A compendium of key search references
ACM SIGIR Forum
Practical minimal perfect hash functions for large databases
Communications of the ACM
Fast search in main memory databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Analysis of bounded disorder file organization
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Domain vector hashing for earth system data querying
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
ACM Computing Surveys (CSUR)
Bounded Disorder File Organization
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.02 |
Perfect hashing refers to hashing with no overflows. We propose and analyze a composite perfect hashing scheme for large external files. The scheme guarantees retrieval of any record in a single disk access. Insertions and deletions are simple, and the file size may vary considerably without adversely affecting the performance. A simple variant of the scheme supports efficient range searches in addition to being a completely dynamic file organization scheme. These advantages are achieved at the cost of a small amount of additional internal storage and increased cost of insertions.