A practical minimal perfect hashing method

Authors:
Fabiano C. Botelho;Yoshiharu Kohayakawa;Nivio Ziviani
Affiliations:
Dept. of Computer Science, Federal Univ. of Minas Gerais, Belo Horizonte, Brazil;Dept. of Computer Science, Univ. of São Paulo, São Paulo, Brazil;Dept. of Computer Science, Federal Univ. of Minas Gerais, Belo Horizonte, Brazil
Venue:
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Year:
2005

Citing 10
Cited 11

Storing a Sparse Table with 0(1) Worst Case Access Time

Journal of the ACM (JACM)
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
An optimal algorithm for generating minimal perfect hash functions

Information Processing Letters
Perfect hashing

Theoretical Computer Science
Introduction to Algorithms

Introduction to Algorithms
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions

WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Graphs, Hypergraphs and Hashing

WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Simple Minimal Perfect Hashing in Less Space

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Counting connected graphs inside-out

Journal of Combinatorial Theory Series B
Integer sets with prescribed pairwise differences being distinct

European Journal of Combinatorics

GigaHash: scalable minimal perfect hashing for billions of urls

Proceedings of the 16th international conference on World Wide Web
Strategies for retrieving plagiarized documents

SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Wikipedia in the pocket: indexing technology for near-duplicate detection and high similarity search

SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
External perfect hashing for very large key sets

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Distributed perfect hashing for very large key sets

Proceedings of the 3rd international conference on Scalable information systems
Online large-margin training of syntactic and structural translation features

EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Searching

Algorithms and theory of computation handbook
Practical perfect hashing in nearly optimal space

Information Systems
Design strategies for minimal perfect hash functions

SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Simple and space-efficient minimal perfect hash functions

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Indexing and retrieving in fingerprint databases under structural distortions

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluation of h(x) requires two memory accesses for any key x and the description of h takes up 1.15n words. This improves the space requirement to 55% of a previous minimal perfect hashing scheme due to Czech, Havas and Majewski. A simple heuristic further reduces the space requirement to 0.93n words, at the expense of a slightly worse constant in the time complexity. Large scale experimental results are presented.