Order preserving minimal perfect hash functions and information retrieval

Authors:
E. A. Fox;Q. F. Chen;A. M. Daoud;L. S. Heath
Affiliations:
Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg VA;Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg VA;Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg VA;Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg VA
Venue:
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
Year:
1989

Citing 10
Cited 3

A polynomial time generator for minimal perfect hash functions

Communications of the ACM
Graphical evolution: an introduction to the theory of random graphs

Graphical evolution: an introduction to the theory of random graphs
Order-preserving key transformations

ACM Transactions on Database Systems (TODS)
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
A more cost effective algorithm for finding perfect hash functions

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Efficient data structures for information retrieval

Efficient data structures for information retrieval
Dynamic hashing schemes

ACM Computing Surveys (CSUR)
An O(n log n) Algorithm for Finding Minimal Perfect Hash Functions

An O(n log n) Algorithm for Finding Minimal Perfect Hash Functions
Implementation of a Perfect Hash Function Scheme

Implementation of a Perfect Hash Function Scheme
Building a large thesaurus for information retrieval

ANLC '88 Proceedings of the second conference on Applied natural language processing

Practical minimal perfect hash functions for large databases

Communications of the ACM
Perfect hash functions for large dictionaries

Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience
Augmented order preserving minimal perfect hash functions for very large digital libraries

CIT'11 Proceedings of the 5th WSEAS international conference on Communications and information technology

Quantified Score

Hi-index	0.02

Visualization

Abstract

Rapid access to information is essential for a wide variety of retrieval systems and applications. Hashing has long been used when the fastest possible direct search is desired, but is generally not appropriate when sequential or range searches are also required. This paper describes a hashing method, developed for collections that are relatively static, that supports both direct and sequential access. Indeed, the algorithm described gives hash functions that are optimal in terms of time and hash table space utilization, and that preserve any a priori ordering desired. Furthermore, the resulting order preserving minimal perfect hash functions (OPMPHFs) can be found using space and time that is on average linear in the number of keys involved.