ACM

Communications of the ACM

Home/Magazine Archive/September 1977 (Vol. 20, No. 9)/Pagination of B*-trees with variable-length records/Abstract

Pagination of B*-trees with variable-length records

By Edward M. McCreight
Communications of the ACM, September 1977, Vol. 20 No. 9, Pages 670-674
10.1145/359810.359839
Comments

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

A strategy is presented for pagination of B*-trees with variable-length records. If records of each length are uniformly distributed within the file, and if a wide distribution of record lengths exists within the file, then this strategy results in shallow trees with fast access times. The performance of this strategy in an application is presented, compared with that of another strategy, and analyzed.

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.