Efficient optimal pagination of scrolls

Authors:
L. L. Larmore;D. S. Hirschberg
Affiliations:
California State Univ., Dominguez Hills;Univ. of California, Irvine
Venue:
Communications of the ACM
Year:
1985

Citing 2
Cited 2

Optimal pagination of B-trees with variable-length items

Communications of the ACM
Pagination of B*-trees with variable-length records

Communications of the ACM

New applications of failure functions

Journal of the ACM (JACM)
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

Quantified Score

Hi-index	48.22

Visualization

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.