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

DOI10.1016/0898-1221(95)00125-IMaRDI QIDQ1900545zbMATH OpenFDO

Authors 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)

Recommendations

• Space-efficient B trees via load-balancing
• B-slack trees: space efficient B-trees
• Improving time and space efficiency in generalized binary search trees
• The space efficiency of quadtrees
• A new algorithm for the construction of optimal B-trees
• scientific article; zbMATH DE number 753967
• scientific article; zbMATH DE number 1143799
• scientific article; zbMATH DE number 3907783
• A uniform model for the storage utilization of \(B\)-tree-like structure
• A uniform model for the storage utilization of B-tree-like structures

Cites work

• scientific article; zbMATH DE number 3904003 (Why is no real title available?)
• scientific article; zbMATH DE number 4033041 (Why is no real title available?)
• scientific article; zbMATH DE number 3653523 (Why is no real title available?)
• scientific article; zbMATH DE number 718139 (Why is no real title available?)
• scientific article; zbMATH DE number 839553 (Why is no real title available?)
• A generalization of AVL trees
• Axioms and hulls
• Height-balanced trees of order (β, γ, δ)
• On random 2-3 trees
• Organization and maintenance of large ordered indexes
• Some average performance measures for the B-tree
• Space saving generalization of \(B\)-trees with \(2/3\) utilization
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Time- and space-optimality in B-trees

Cited in

(8)

• B-slack trees: space efficient B-trees
• scientific article; zbMATH DE number 3843183 (Why is no real title available?)
• Improving time and space efficiency in generalized binary search trees
• A uniform model for the storage utilization of \(B\)-tree-like structure
• \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half
• Height-balanced trees of order (β, γ, δ)
• Space saving generalization of \(B\)-trees with \(2/3\) utilization
• Variance of storage requirements for B+-trees

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

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