Implementation of a Perfect Hash Function Scheme

Authors:
Sanjeev Datta;Edward A. Fox
Affiliations:
-;-
Venue:
Implementation of a Perfect Hash Function Scheme
Year:
1989

Citing 0
Cited 4

A more cost effective algorithm for finding perfect hash functions

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
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

Quantified Score

Hi-index	0.02

Visualization

Abstract

This report surveys the recent development in computing perfect hash functions, and in particular, closely examines an algorithm proposed by Thomas Sager. An implementation of that algorithm in C has been done to demonstrate and verify the behavior of the algorithm for various settings of parameters.