Richard P. Brent
Abstract
A new method for entering and retrieving information in a hash table is described. The method is intended to be efficient if most entries are looked up several times. The expected number of probes to look up an entry, predicted theoretically and verified by Monte Carlo experiments, is considerably less than for other comparable methods if the table is nearly full. An example of a possible Fortran implementation is given.
- 1 Bell, J. R. The quadratic quotient method: a hash code eliminating secondary clustering. Comm. ACM13, 2 (Feb. 1970), 107-109. Google Scholar
Digital Library
- 2 Bell, J.R., and Kaman, C.H. The linear quotient hash code. Comm. ACM 13, 11 (Nov. 1970), 675-677. Google ScholarDigital Library
- 3 Johnson, L.R. An indirect chaining method for addressing on secondary keys. Comm. ACM4, 5 (May 1961), 218-222. Google ScholarDigital Library
- 4 Maurer, W.D. An improved hash code for scatter storage. Comm. ACM 11, 1 (Jan. 1968), 35-38. Google ScholarDigital Library
- 5 Morris, R. Scatter storage techniques. Comm. ACM 11, 1 (Jan. 1968), 38-44. Google ScholarDigital Library
- 6 Radke, C.E. The use of quadratic residue research. Comm. ACM 13, 2 (Feb. 1970), 103-105. Google ScholarDigital Library
Recommendations
The linear quotient hash code
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 ...
An improved hash code for scatter storage
Special 25th Anniversary IssueIntroduced 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 ...
Comment on Brent's scatter storage algorithm
R.P. Brent in his presentation of a modification to the linear quotient algorithm [1] shares the common misconception that dynamic chaining requires larger table entries because of the space required for link fields.
Comments