James R. Bell
Skip Abstract Section
Abstract
A new method of hash coding is presented and is shown to possess desirable attributes. Specifically, the algorithm is simple, efficient, and exhaustive, while needing little time per probe and using few probes per lookup. Performance data and implementation hints are also given.
- 1 MORRIS, R. Scatter storage techniques. Comm. ACM 11, 1 (Jan. 1968), 35-38. Google Scholar
Digital Library
- 2 MAURER, W. D. An improved hash code for scatter storage. Comm. ACM 11, 1 (Jan. 1968), 38-44. Google ScholarDigital Library
- 3 BELL, J. R. The quadratic quotient method: A hash code eliminating secondary clustering. Comm. ACM 13, 2 (Feb. 1970), 107-109. Google ScholarDigital Library
- 4 RADKE, E. E. The use of quadratic residue research. Comm. ACM 13, 2 (Feb. 1970), 103-105. Google ScholarDigital Library
Recommendations
The quadratic quotient method: a hash code eliminating secondary clustering
Secondary clustering as a cause of hash code inefficiency is discussed, and a new hashing method based on its eliminiation is presented. Comparisons with previous methods are made both analytically and empirically.
Comments