Additional results on key-to-address transform techniques: a fundamental performance study on large existing formatted files

Authors:
V. Y. Lum;P. S. T. Yuen
Affiliations:
IBM Research Lab., San Jose, CA;IBM Research Lab., San Jose, CA
Venue:
Communications of the ACM
Year:
1972

Citing 1
Cited 3

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

Communications of the ACM

A compendium of key search references

ACM SIGIR Forum
Statistical behavior of fast hashing of variable length test strings

ACM SIGIR Forum
Hash Table Methods

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	48.22

Visualization

Abstract

In 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 radix transformation. Andrew Lin has since pointed out to the authors that his method of transformation [2] consists of not just a radix transformation algorithm but also the specific ways the values of p and q are chosen as well as hardware implementation to carry out the steps of this transformation in an efficient manner. Since our study was intended for general radix transformations rather than Lin's specific implementation, we think it is more appropriate to change the label of that transformation in [1] from “Lin's method” to “generalized radix transformation method” and we use this term here.