Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- articleMarch 1977
Improving the access time for random access files
Communications of the ACM (CACM), Volume 20, Issue 3Pages 127–135https://doi.org/10.1145/359436.359438Clustering 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 ...
- articleOctober 1973
General performance analysis of key-to-address transformation methods using an abstract file concept
Communications of the ACM (CACM), Volume 16, Issue 10Pages 603–612https://doi.org/10.1145/362375.362385This paper presents a new approach to the analysis of performance of the various key-to-address transformation methods. In this approach the keys in a file are assumed to have been selected from the key space according to a certain probabilistic ...
- articleNovember 1972
Additional results on key-to-address transform techniques: a fundamental performance study on large existing formatted files
Communications of the ACM (CACM), Volume 15, Issue 11Pages 996–997https://doi.org/10.1145/355606.361893In an earlier paper by Lum, Yuen, and Dodd [1] experimental results comparing six commonly used key-to-address transformation techniques were presented. One transformation in that study referred to as “Lin's method” is an elaborate technique based on ...
