A uniform model for the storage utilization of B-tree-like structures
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 45266 (Why is no real title available?)
- scientific article; zbMATH DE number 50660 (Why is no real title available?)
- scientific article; zbMATH DE number 193017 (Why is no real title available?)
- Dynamic hashing
- Expected behaviour of \(B^+\)-trees under random insertions
- Riordan arrays and combinatorial sums
- Singularity Analysis of Generating Functions
- Some average performance measures for the B-tree
- Space utilization and access path length in B-trees
- The Riordan group
Cited in
(6)- Space saving generalization of \(B\)-trees with \(2/3\) utilization
- Riordan matrices and higher-dimensional lattice walks
- Modeling B-tree insertion activity
- Certain Occupancy Numbers Via an Algorithm for Computing Their Ratios
- A uniform model for the storage utilization of \(B\)-tree-like structure
- scientific article; zbMATH DE number 1143799 (Why is no real title available?)
This page was built for publication: A uniform model for the storage utilization of B-tree-like structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350769)