Optimal pagination of B-trees with variable-length items

DOI10.1145/357994.358025zbMath0587.68061OpenAlexW2094127279MaRDI QIDQ3714476

Bruce Faaland, George Diehr

Publication date: 1984

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/357994.358025

zbMATH Keywords

algorithmsdynamic programmingshortest-path problemsminimum depth treesum of key lengths

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (3)

Skip trees, an alternative data structure to skip lists in a concurrent approach ⋮ Algorithms for a hashed file with variable-length records ⋮ Worst-case data structures for the priority queue with attrition

This page was built for publication: Optimal pagination of B-trees with variable-length items