Space saving generalization of \(B\)-trees with \(2/3\) utilization

DOI10.1016/0898-1221(95)00125-IzbMath0835.68027MaRDI QIDQ1900545

K. V. Shvachko

Publication date: 16 April 1996

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

\(B\)-tree\(S(b)\)-treeslocal incompressibilitylogarithmic running time algorithm

Mathematics Subject Classification ID

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

Related Items (1)

Space saving generalization of \(B\)-trees with \(2/3\) utilization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some average performance measures for the B-tree
• Axioms and hulls
• On random 2-3 trees
• Space saving generalization of \(B\)-trees with \(2/3\) utilization
• Organization and maintenance of large ordered indexes
• Symmetric binary B-trees: Data structure and maintenance algorithms
• A generalization of AVL trees
• Height-balanced trees of order (β, γ, δ)
• Time- and space-optimality in B-trees

This page was built for publication: Space saving generalization of \(B\)-trees with \(2/3\) utilization