The reallocation of hash-coded tables

Authors:
Carter Bays
Affiliations:
Univ. of South Carolina
Venue:
Communications of the ACM
Year:
1973

Citing 3
Cited 9

The quadratic quotient method: a hash code eliminating secondary clustering

Communications of the ACM
The linear quotient hash code

Communications of the ACM
Scatter storage techniques

Communications of the ACM

VM/XA SP2 minidisk cache

IBM Systems Journal
A compendium of key search references

ACM SIGIR Forum
A New Approach to the Analysis of Linear Probing Schemes

Journal of the ACM (JACM)
Techniques for collision resolution in hash tables with open addressing

ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Hash Table Methods

ACM Computing Surveys (CSUR)
MPACT: microprocessor application to control-firmware translator

ACM SIGDA Newsletter
Virtual hashing: a dynamically changing hashing

VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Linear hashing: a new tool for file and table addressing

VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Variable-length hash area entries

AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference

Quantified Score

Hi-index	48.22

Visualization

Abstract

When the space allocation for a hash-coded table is altered, the table entries must be rescattered over the new space. A technique for accomplishing this rescattering is presented. The technique is independent of both the length of the table and the hashing function used, and can be utilized in conjunction with a linear reallocation of the table being rescattered. Moreover, it can be used to eliminate previously flagged deletions from any hash-coded table, or to change from one hashing method to another. The efficiency of the technique is discussed and theoretical statistics are given.