scientific article; zbMATH DE number 1143799

zbMATH Open0893.68114MaRDI QIDQ4385986FDOQ4385986

José Luis Palacios

Publication date: 3 August 1998

Title of this publication is not available (Why is that?)

Recommendations

• Improving time and space efficiency in generalized binary search trees
• STORAGE OVERHEAD OF O-TREES, B-TREES AND PREFIX B-TREES: A COMPARATIVE ANALYSIS
• An analysis of fixed-point queries on binary trees
• The \(m\)-version of binary search trees: an average case analysis
• Dynamic indexability and the optimality of B-trees
• A uniform model for the storage utilization of B-tree-like structures
• A uniform model for the storage utilization of \(B\)-tree-like structure
• Variance of storage requirements for B+-trees

zbMATH Keywords

binary search trees

Mathematics Subject Classification ID

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

Cited In (4)

• A uniform model for the storage utilization of \(B\)-tree-like structure
• Improving time and space efficiency in generalized binary search trees
• Some average measures in m-ary search trees
• Space saving generalization of \(B\)-trees with \(2/3\) utilization

This page was built for publication:

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