Reducing the retrieval time of hashing method by using predictors

Authors:
Seiichi Nishihara;Katsuo Ikeda
Affiliations:
Univ. of Tsukuba, Ibaraki, Japan;Univ. of Tsukuba, Ibaraki, Japan
Venue:
Communications of the ACM
Year:
1983

Citing 4
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
Pseudochaining in hash tables

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

Communications of the ACM
Scatter storage techniques

Communications of the ACM

Quantified Score

Hi-index	48.22

Visualization

Abstract

Many methods for resolving collisions in hashing techniques have been proposed. They are classified into two main categories: open addressing and chaining. In this paper, other methods are presented that are intermediate between the two categories. The basic idea of our methods is the use of one or more predictors reserved per cell instead of a link field as in the chaining method. The predictors are used to maintain loose synonym chains. After describing the methods, the efficiencies are estimated theoretically and verified experimentally. In comparison with the chaining method, we prove that our methods significantly reduce the average number of probes necessary to retrieve a key without expending extra space.