Improving the access time for random access files

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Clustering in the key set is decreased by smoothing the key-to-address transformation, and by adding shadow buckets to an open chaining file. The keys are pre-hashed before the address division, to remove the effect of sequential properties in the key set. Shadow buckets in the key search sequence reduce the effect of nonuniformity in file loading, and decrease the number of maximum probes needed to locate a record. The combined effects of these techniques lead to improved file performance for secondary storage devices, as shown by empirical studies. © 1977, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Clapson, P. (1977). Improving the access time for random access files. Communications of the ACM, 20(3), 127–135. https://doi.org/10.1145/359436.359438

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free