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
On aspects of university and performance for closed hashing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Perfect hashing using sparse matrix packing
Information Systems
Order preserving minimal perfect hash functions and information retrieval
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
Practical minimal perfect hash functions for large databases
Communications of the ACM
Efficient data structures for information retrieval
Efficient data structures for information retrieval
Integrating IR and RDBMS using cooperative indexing
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Theoretical Computer Science
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
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
Perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
In-memory hash tables for accumulating text vocabularies
Information Processing Letters
The webgraph framework I: compression techniques
Proceedings of the 13th international conference on World Wide Web
| Hi-index | 0.00 |
We describe a new practical algorithm for finding perfect hash functions with no specification space at all, suitable for key sets ranging in size from small to very large. The method is able to find perfect hash functions for various sizes of key sets in linear time. The perfect hash functions produced are optimal in terms of time (perfect) and require at most computation of h1(k) and h2(k); two simple auxiliary pseudorandom functions.