Comment on Brent's scatter storage algorithm

Authors:
Jerome A. Feldman;James R. Low
Affiliations:
Stanford Univ., Stanford, CA;Stanford Univ., Stanford, CA
Venue:
Communications of the ACM
Year:
1973

Citing 1
Cited 3

Reducing the retrieval time of scatter storage techniques

Communications of the ACM

A compendium of key search references

ACM SIGIR Forum
Packed scatter tables

Communications of the ACM
Compact Hash Tables Using Bidirectional Linear Probing

IEEE Transactions on Computers

Quantified Score

Hi-index	48.24

Visualization

Abstract

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.