An improved hash code for scatter storage

Authors:
W. D. Maurer
Affiliations:
Univ. of California, Berkeley
Venue:
Communications of the ACM - Special 25th Anniversary Issue
Year:
1983

Citing 1
Cited 3

Scatter storage techniques

Communications of the ACM

Differential files: their application to the maintenance of large databases

ACM Transactions on Database Systems (TODS)
An Elementary Discussion of Compiler/Interpreter Writing

ACM Computing Surveys (CSUR)
Hash Table Methods

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Introduced is a hash coding method based on fixed-point division rather than multiplication or logical operations. This new method allows the hash table to have almost any length. Also a new method of handling collisions is discussed. Known as quadratic search, this method is faster than random search and free from the “clusters” that build up with a linear search.