Hash Coding and Optimally Ordered Entries.
Abstract
Arguments for deriving an optimal input sequence from a static set of hash-coded entries and a method for determining such a sequence are presented. The method consists of inspecting the uniformity of the distribution of primary and secondary addresses produced by a hash function and a search method, and determining the order of entry-input in such a way that a minimal number of searches produces an empty slot for each entry. As a result, both the average number of probes and the maximum number of probes are as low as possible for the set of entries. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1971
- Accession Number
- AD0729268
Entities
People
- Karen A. Mullen
Organizations
- University of Iowa