Efficient optimal pagination of scrolls-Reference-Cited by-同舟云学术

Efficient optimal pagination of scrolls

Published:1985-08 Issue:8 Volume:28 Page:854-856
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Larmore L. L.¹,Hirschberg D. S.²

Affiliation:

1. California State Univ., Dominguez Hills

2. Univ. of California, Irvine

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.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

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

Reference2 articles.

1. Optimal pagination of B-trees with variable-length items

2. Pagination of B*-trees with variable-length records

Cited by 9 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. 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

4. Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues;SIAM Journal on Computing;1995-12

5. Algorithms for a hashed file with variable-length records;Information Sciences;1992-09