General performance analysis of key-to-address transformation methods using an abstract file concept

Authors:
V. Y. Lum
Affiliations:
IBM Research Lab, San Jose, CA
Venue:
Communications of the ACM
Year:
1973

Citing 1
Cited 12

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

Communications of the ACM

Hashing practice: analysis of hashing and universal hashing

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A compendium of key search references

ACM SIGIR Forum
Hash Table Methods

ACM Computing Surveys (CSUR)
On the performance of balanced hashing functions when the keys are not equiprobable

ACM Transactions on Programming Languages and Systems (TOPLAS)
Comparison of synonym handling and bucket organization methods

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
Virtual hashing: a dynamically changing hashing

VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
Linear hashing: a new tool for file and table addressing

VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
Compact Hash Tables Using Bidirectional Linear Probing

IEEE Transactions on Computers
INGRES: a relational data base system

AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Data base systems

IBM Systems Journal
Data structures and data accessing in data base systems past, present, future

IBM Systems Journal

Quantified Score

Hi-index	48.24

Visualization

Abstract

This 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 selection algorithm. All files with the same number of keys selected from this key space will be suitably weighted in accordance with the algorithm, and the average performance of the transformation methods on these files will be used as the potential of these methods. Using this analysis, methods with the same overall performance can be classified and key distributions partial to certain transformations can be identified. All this can be done analytically. The approach is applied to a group of transformation methods using files whose keys are selected randomly.