A more cost effective algorithm for finding perfect hash functions

Authors:
E. A. Fox;Q.-F. Chen;L. Heath;S. Datta
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:
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Year:
1989

Citing 8
Cited 5

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
Dynamic hashing schemes

ACM Computing Surveys (CSUR)
Reciprocal hashing: a method for generating minimal perfect hashing functions

Communications of the ACM
Minimal perfect hash functions made simple

Communications of the ACM
Implementation of a Perfect Hash Function Scheme

Implementation of a Perfect Hash Function Scheme
Building the CODER Lexicon: The Collins English Dictionary and Its Adverb Definitions

Building the CODER Lexicon: The Collins English Dictionary and Its Adverb Definitions

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
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
Using Tries to Eliminate Pattern Collisions in Perfect Hashing

IEEE Transactions on Knowledge and Data Engineering
Rapid retrieval algorithms for case-based reasoning

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.02

Visualization

Abstract

As the use of knowledge-based systems increases, there will be a growing need for efficient artificial intelligence systems and methods to access large lexicons. In the COmposite Document Expert/extended/effective Retrieval (CODER) system we have, in order to provide rapid access to data items on CD-ROMs and to terms in a lexicon built from machine readable dictionaries, investigated the construction of perfect hash functions. We have considered algorithms reported earlier in the literature, have made numerous enhancements to them, have developed new algorithms, and here report on some of our results. This paper covers an O(n3) algorithm that has been applied to building hash functions for a collection of 69806 words on a CD-ROM. Most recently we have developed a much better algorithm and have succeeded in finding a perfect hash function for a set of 130,199 words taken from sources including the Collins English Dictionary.