minimizing the retrieval time of scatter storage techniques
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.
scatter storage hash coding minimal retrieval