Random access file organization for indirectly addressed records

Authors:
Charles A. Olson
Affiliations:
-
Venue:
ACM '69 Proceedings of the 1969 24th national conference
Year:
1969

Citing 1
Cited 13

Scatter storage techniques

Communications of the ACM

Analysis of Uniform Hashing

Journal of the ACM (JACM)
Identifier Search Mechanisms: A Survey and Generalized Model

ACM Computing Surveys (CSUR)
Hash Table Methods

ACM Computing Surveys (CSUR)
The study of an ordered minimal perfect hashing scheme

Communications of the ACM
Improving the access time for random access files

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
Database cost analysis: a top-down approach

SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Hierarchical multi-granular modeling to improve software performance

ANSS '82 Proceedings of the 15th annual symposium on Simulation
A graduate course in database management

ACM SIGMOD Record
Optimum storage allocation for a file in steady state

IBM Journal of Research and Development
Expandable open addressing hash table storage and retrieval

SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Bibliography on data base structures

ACM SIGMIS Database

Quantified Score

Hi-index	0.06

Visualization

Abstract

Random access file organization is discussed for the case of indirect addressing and a high rate of additions and deletions. The equations derived for this special situation are substantially different from those usually used in estimating file requirements. Graphs are included which make it possible to estimate file utilization and overflow, as shown in several simple examples.