Pagination of B*-trees with variable-length records-Reference-Cited by-同舟云学术

Pagination of B*-trees with variable-length records

Published:1977-09 Issue:9 Volume:20 Page:670-674
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

McCreight Edward M.¹

Affiliation:

1. Xerox Palo Alto Research Center, Palo Alto, CA

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/359810.359839

Reference6 articles.

1. Bayer R. and McCreight E. Organization and maintenance of large ordered indexes. Acta lnformatica 1 (1972) 290-306. Bayer R. and McCreight E. Organization and maintenance of large ordered indexes. Acta lnformatica 1 (1972) 290-306.

2. Indexing design considerations

3. VSAM data set design parameters

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Batched Predecessor and Sorting with Size-Priced Information in External Memory;LATIN 2020: Theoretical Informatics;2020

2. B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys;ACM Transactions on Database Systems;2016-08-08

3. Generic and efficient framework for search trees on flash memory storage systems;GeoInformatica;2012-08-30

4. Performance guarantees for B-trees with different-sized atomic keys;Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems of data - PODS '10;2010

5. Advanced Data Structures;2008