Pagination of B*-trees with variable-length records
- 1 September 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 20 (9) , 670-674
- https://doi.org/10.1145/359810.359839
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.Keywords
This publication has 2 references indexed in Scilit:
- VSAM data set design parametersIBM Systems Journal, 1974
- Indexing design considerationsIBM Systems Journal, 1973