Minimizing the retrieval time of scatter storage techniques

Authors:
Thomas C. Irby
Affiliations:
-
Venue:
ACM '78 Proceedings of the 1978 annual conference - Volume 2
Year:
1978

Citing 7
Cited 0

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
The quadratic hash method when the table size is not a prime number

Communications of the ACM
Reducing the retrieval time of scatter storage techniques

Communications of the ACM
The quadratic quotient method: a hash code eliminating secondary clustering

Communications of the ACM
The linear quotient hash code

Communications of the ACM
Scatter storage techniques

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

A technique is described for minimizing the number of probes needed to retrieve a given set of entries from a hash table using a specific hash code. The method is useful for tables where the expected number of retrievals is large. An example is given which illustrates the usefulness of the method for an assembler operation code table. Comparisons of the method are made with other hashing techniques and with binary search methods.