ACM

Communications of the ACM

Home/Magazine Archive/May 1961 (Vol. 4, No. 5)/An indirect chaining method for addressing on secondary.../Abstract

An indirect chaining method for addressing on secondary keys

By L. R. Johnson
Communications of the ACM, May 1961, Vol. 4 No. 5, Pages 218-222
10.1145/366532.366540
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.