A faster algorithm for constructing minimal perfect hash functions

Authors:
Edward A. Fox;Qi Fan Chen;Lenwood S. Heath
Affiliations:
Department of Computer Science and Computing Center, Virginia Polytechnic Institute and State University, Blacksburg, VA;Department of Computer Science and Computing Center, Virginia Polytechnic Institute and State University, Blacksburg, VA;Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA
Venue:
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
Year:
1992

Citing 10
Cited 8

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
Letter-oriented reciprocal hashing scheme

Information Sciences: an International Journal
Development of the CODER system: a testbed for artificial intelligence methods in information retrieval

Information Processing and Management: an International Journal - Artificial Intelligence and Information Retrieval
Fast hashing of variable-length text strings

Communications of the ACM
Order-preserving minimal perfect hash functions and information retrieval

ACM Transactions on Information Systems (TOIS) - Special issue on research and development in information retrieval
Practical minimal perfect hash functions for large databases

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
Integrated Access to a Large Medical Literature Database

Integrated Access to a Large Medical Literature Database

Techniques for automatically correcting words in text

ACM Computing Surveys (CSUR)
Provable bounds for portable and flexible privacy-preserving access

Proceedings of the tenth ACM symposium on Access control models and technologies
Succinct representation of flexible and privacy-preserving access rights

The VLDB Journal — The International Journal on Very Large Data Bases
External perfect hashing for very large key sets

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
A practical minimal perfect hashing method

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
S-Index: a hybrid structure for text retrieval

ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
Practical perfect hashing in nearly optimal space

Information Systems
Simple and space-efficient minimal perfect hash functions

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this problem. Here, a new algorithm is described for quickly finding minimal perfect hash functions whose specification space is very close to the theoretical lower bound, i.e., around 2 bits per key. The various stages of processing are detailed, along with analytical and empirical results, including timing for a set of over 3.8 million keys that was processed on a NeXTstation in about 6 hours.