Optimal pagination of B-trees with variable-length items

DOI10.1145/357994.358025MaRDI QIDQ3714476zbMATH OpenOpenAlexFDO

Authors George Diehr, Bruce Faaland

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 programmingminimum depth treeshortest-path problemssum of key lengths

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 753967
• Cost-optimal parallel algorithms for constructing B-trees
• A new algorithm for the construction of optimal B-trees
• Memory management for B-trees
• Publication:5750392

Cited in

(5)

• Algorithms for a hashed file with variable-length records
• Worst-case data structures for the priority queue with attrition
• Memory management for B-trees
• Skip trees, an alternative data structure to skip lists in a concurrent approach
• A new algorithm for the construction of optimal B-trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714476)