Optimum storage allocation for a file with open addressing

Authors:
J. A. van der Pool
Affiliations:
IBM Nederland N.V. Amsterdam, The Netherlands
Venue:
IBM Journal of Research and Development
Year:
1973

Citing 6
Cited 0

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Addressing for Random-Access Storage with Multiple Bucket Capacities

Journal of the ACM (JACM)
Service in a Loop System

Journal of the ACM (JACM)
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
Analysis of a file addressing method

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

File organizations utilizing key-to-address transformation and open addressing are studied. A simulation method and a Markov model, which were used for evaluation, are presented. The cost of retrieval as a function of storage space and accesses is also formulated. The minimum of the combined costs for different operational conditions is determined.