An introduction to computed chaining

Authors:
Kuo-Chung Tai;Alan L. Tharp
Affiliations:
North Carolina State University, Raleigh, North Carolina;North Carolina State University, Raleigh, North Carolina
Venue:
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Year:
1980

Citing 8
Cited 0

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

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Optimal Arrangement of Keys in a Hash Table

Journal of the ACM (JACM)
Hash Table Methods

ACM Computing Surveys (CSUR)
Pseudochaining in hash tables

Communications of the ACM
Packed scatter tables

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

Communications of the ACM
Key-to-address transform techniques: a fundamental performance study on large existing formatted files

Communications of the ACM
The linear quotient hash code

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

A hashing function, H(x), is a transformation from a key value x to an address. Since such transformations may produce the same address for distinct keys, hashing functions lead to collisions in the address space. Many methods for resolving hashing collisions have been reported [1, 2]. Direct chaining and open addressing are the two basic collision-resolution methods. This paper presents a form of hybrid hashing, computed chaining, which is better than a previously described hybrid hashing procedure called pseudochaining [3]. In certain situations it is also better than other collision procedures.