Analysis of a file addressing method

Authors:
G. Schay, Jr.;W. G. Spruth
Affiliations:
IBM Corporation, Yorktown Heights, NY;IBM Corporation, Yorktown Heights, NY
Venue:
Communications of the ACM
Year:
1962

Citing 2
Cited 15

Computer Time for Address Calculation Sorting

Journal of the ACM (JACM)
An indirect chaining method for addressing on secondary keys

Communications of the ACM

Linear probing with a nonuniform address distribution

Journal of the ACM (JACM)
A compendium of key search references

ACM SIGIR Forum
Addressing for Random-Access Storage with Multiple Bucket Capacities

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
Identifier Search Mechanisms: A Survey and Generalized Model

ACM Computing Surveys (CSUR)
Hash Table Methods

ACM Computing Surveys (CSUR)
Scatter storage techniques

Communications of the ACM - Special 25th Anniversary Issue
The study of an ordered minimal perfect hashing scheme

Communications of the ACM
A practitioner's guide to addressing algorithms

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

Communications of the ACM
Scatter storage techniques

Communications of the ACM
A variant method of file searching

Communications of the ACM
File organization and addressing

IBM Systems Journal
Optimum storage allocation for a file with open addressing

IBM Journal of Research and Development
Bibliography on data base structures

ACM SIGMIS Database

Quantified Score

Hi-index	48.30

Visualization

Abstract

This paper presents a new file addressing method based on the calculation of an address from the identification of a record. For large recirculating type files, it seems to be more advantageous than customary ones. The probability distribution of the displacement of records from their calculated address, which is one less than the number of probes required to address a record, is computed on the basis of a Markov chain model. For the reader not interested in the mathematics, the introduction and the summary should be sufficient.