ACM

Communications of the ACM

Home/Magazine Archive/October 1969 (Vol. 12, No. 10)/Retrieval times for a packed direct access inverted.../Abstract

Retrieval times for a packed direct access inverted file

By A. J. Bayes
Communications of the ACM, October 1969, Vol. 12 No. 10, Pages 582-583
10.1145/363235.363268
Comments

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

This note extends the results obtained by Thomas C. Lowe [1] for the case where the list file is stored in packed form. The notation and terminology used were established by Lowe. In addition, we define F(j) = ∑j-1i=1 ƒ(i) and write [x] for the greatest integer not exceeding x.

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.