Efficient optimal pagination of scrolls
- 1 August 1985
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 28 (8), 854-856
- https://doi.org/10.1145/4021.4026
Abstract
Diehr and Faaland developed an algorithm that finds the minimum sum of key length pagination of a scroll of n items, and which uses O(n log n) time, solving a problem posed by McCreight. An improved algorithm is given which uses O(n) time.Keywords
This publication has 2 references indexed in Scilit:
- Optimal pagination of B-trees with variable-length itemsCommunications of the ACM, 1984
- Pagination of B*-trees with variable-length recordsCommunications of the ACM, 1977