A probability model for overflow sufficiency in small hash tables

Authors:
R. M. Norton;D. P. Yeager
Affiliations:
The College of Charleston, Charleston, SC;Univ. of Alabama, University
Venue:
Communications of the ACM
Year:
1985

Citing 2
Cited 3

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Implementations for coalesced hashing

Communications of the ACM

Hashing practice: analysis of hashing and universal hashing

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A compendium of key search references

ACM SIGIR Forum
Analysis of bounded disorder file organization

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Quantified Score

Hi-index	48.22

Visualization

Abstract

For hash tables in which a strict physical separation exists between primary storage and storage for overflow records, with bucket capacity at least three, a complete probability model is described. A measure of hash table efficiency is introduced, called the table sufficiency index (TSI), and defined as the probability that the overflow space is sufficient assuming that the set of hashed keys has a uniform distribution. The constructed probability model may be used to compute the TSI for hash tables with parameters chosen from a restricted domain. The TSI is advocated as a tool for making decisions about the parameters of small hash tables.