Approximate storage utilisation of B-trees: a simple derivation and generalisations
Information Processing Letters
Approximate storage utilization of B-trees
Information Processing Letters
Performance of B-tree concurrency control algorithms
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
The performance of current B-tree algorithms
ACM Transactions on Database Systems (TODS)
Lazy updates for distributed search structure
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Implementing deletion in B+-trees
ACM SIGMOD Record
ACM Computing Surveys (CSUR)
A framework for the performance analysis of concurrent B-tree algorithms
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Performance of B+ tree concurrency control algorithms
The VLDB Journal — The International Journal on Very Large Data Bases
A Combined Method for Maintaining Large Indices in Multiprocessor Multidisk Environments
IEEE Transactions on Knowledge and Data Engineering
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees
IEEE Transactions on Knowledge and Data Engineering
Simple, Robust and Highly Concurrent B-trees with Node Deletion
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Authenticating Query Results in Edge Computing
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Transaction support for indexed summary views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient columnar storage in B-trees
ACM SIGMOD Record
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Deletion without Rebalancing in Multiway Search Trees
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Enhancing the B+-tree by dynamic node popularity caching
Information Processing Letters
Foundations and Trends in Databases
Deletion without rebalancing in multiway search trees
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
The utilization of B-tree nodes determines the number of levels in the B-tree and hence its performance. Until now, the only analytical aid to the determination of a B-tree's utilization has been the analysis by Yao and related work. Yao showed that the utilization of B-tree nodes under pure inserts was 69%. We derive analytically and verify by simulation the utilization of B-tree nodes constructed from N inserts followed by M modifies (where M N), where each modify is a delete followed by an insert. Assuming that nodes only merge when they are empty (the technique used in most database management systems), we show that the utilization is 39% as M becomes large. We extend this model to a parameterized mixture of inserts and modifies. Surprisingly, if the modifies are mixed with just 10% inserts, then the utilization is over 62%. We also calculated the probability of splitting and merging. We derive a simple rule-of-thumb that accurately calculates the probability of splitting. We present two models for computing this utilization, the more accurate of which remembers items inserted and then deleted in a node - we call such items ghosts.