National Technical Reports Library

The National Technical Information Service acquires, indexes, abstracts, and archives the largest collection of U.S. government-sponsored technical reports in existence. The NTRL offers online, free and open access to these authenticated government technical reports. Technical reports and documents in its repository may be available online for free either from the issuing federal agency, the U.S. Government Publishing Office’s Federal Digital System website, or through search engines.

Details

Alternation-Tree Insertions for Open-Addressed Hash Buckets.

PB82101312

Publication Date	1981
Personal Author	Lyon, G. E.
Page Count	4
Abstract	Open-addressing is a hashing method that uses no explicit table structures such as bit fields, pointers, or index linkages. It is a compact method of storing information that can later be retrieved, on the average, very quickly. However, sometimes the objective is not so much to achieve a fast average retrieval as it is to ensure that worst cases are short. It is known that for hashing into buckets, worst case searches can usually be limited to two probes, although known computational methods to do this can be slow. In attacking this problem of computation, principal focus is upon a new, practical algorithm that constructs tables cheaply.
Keywords	Computer programming Addressing Algorithms Data retrieval Data storage Hashing
Source Agency	National Institute of Standards and Technology
NTIS Subject Category	62B - Computer Software
Corporate Authors	National Bureau of Standards, Washington, DC.
Document Type	Technical Report
Title Note	Final rept.
NTIS Issue Number	198201

Alternation-Tree Insertions for Open-Addressed Hash Buckets.

Alternation-Tree Insertions for Open-Addressed Hash Buckets.
PB82101312

Publication Date	1981
Personal Author	Lyon, G. E.
Page Count	4
Abstract	Open-addressing is a hashing method that uses no explicit table structures such as bit fields, pointers, or index linkages. It is a compact method of storing information that can later be retrieved, on the average, very quickly. However, sometimes the objective is not so much to achieve a fast average retrieval as it is to ensure that worst cases are short. It is known that for hashing into buckets, worst case searches can usually be limited to two probes, although known computational methods to do this can be slow. In attacking this problem of computation, principal focus is upon a new, practical algorithm that constructs tables cheaply.
Keywords	Computer programming Addressing Algorithms Data retrieval Data storage Hashing
Source Agency	National Institute of Standards and Technology
NTIS Subject Category	62B - Computer Software
Corporate Authors	National Bureau of Standards, Washington, DC.
Document Type	Technical Report
Title Note	Final rept.
NTIS Issue Number	198201