scientific article; zbMATH DE number 1143799
From MaRDI portal
Publication:4385986
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
Cited in
(6)- Improving time and space efficiency in generalized binary search trees
- Some average measures in m-ary search 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
- Space saving generalization of \(B\)-trees with \(2/3\) utilization
- STORAGE OVERHEAD OF O-TREES, B-TREES AND PREFIX B-TREES: A COMPARATIVE ANALYSIS
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)
