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

DOI10.1016/0898-1221(95)00125-IzbMATH Open0835.68027MaRDI QIDQ1900545FDOQ1900545

Authors: K. V. Shvachko 

Publication date: 16 April 1996

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

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

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)

Cites Work

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

Cited In (8)

• \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half
• A uniform model for the storage utilization of \(B\)-tree-like structure
• B-slack trees: space efficient B-trees
• Title not available (Why is that?)
• Improving time and space efficiency in generalized binary search trees
• 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)