An indirect chaining method for addressing on secondary keys

1 May 1961

journal article
Published by Association for Computing Machinery (ACM) in Communications of the ACM

Vol. 4 (5) , 218-222
https://doi.org/10.1145/366532.366540

Abstract

Methods for entering random-access files on the basis of one key are briefly surveyed. The widely used chaining method, based on a pseudo-random key transformation, is reviewed in more detail. An efficient generalization of the chaining method which permits recovery on additional keys is then presented.

Keywords

RANDOM-ACCESS FILE
CHAINING METHOD
EFFICIENT GENERALIZATION
PSEUDO-RANDOM KEY TRANSFORMATION
SECONDARY KEY
INDIRECT CHAINING METHOD
ADDITIONAL KEY
RANDOM ACCESS

This publication has 2 references indexed in Scilit:

Addressing for Random-Access Storage
IBM Journal of Research and Development, 1957
Programming the logic theory machine
Published by Association for Computing Machinery (ACM) ,1957