A probability model for overflow sufficiency in small hash tables
- 1 October 1985
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 28 (10) , 1068-1075
- https://doi.org/10.1145/4372.4377
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.Keywords
This publication has 3 references indexed in Scilit:
- Implementations for coalesced hashingCommunications of the ACM, 1982
- Optimum Storage Allocation for Initial Loading of a FileIBM Journal of Research and Development, 1972
- Addressing for Random-Access StorageIBM Journal of Research and Development, 1957