Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
Expected behaviour of B+-trees under random insertions
Acta Informatica
ACM Computing Surveys (CSUR)
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
The performance of a multiversion access method
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A compendium of key search references
ACM SIGIR Forum
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Performance analysis of file organizations that use multibucket data leaves with partial expansions
ACM Transactions on Database Systems (TODS)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Sibling clustering of tree-based spatial indexes for efficient spatial query processing
Proceedings of the seventh international conference on Information and knowledge management
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
A multivariate view of random bucket digital search trees
Journal of Algorithms - Analysis of algorithms
Bounded Disorder File Organization
IEEE Transactions on Knowledge and Data Engineering
A Combined Method for Maintaining Large Indices in Multiprocessor Multidisk Environments
IEEE Transactions on Knowledge and Data Engineering
Probabilistic Model and Optimal Reorganization of B+-Tree with Physical Clustering
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Performance Evaluation of Lazy Deletion Methods in R-trees
Geoinformatica
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
The authors mathematically analyze the behavior of B/sup trees with partial expansions file structure under random insertions, focusing on the expected storage utilization and the expected cost of insertions. The model can be used for studying both the asymptotic and dynamic behavior. The accuracy of the model is confirmed by simulation. Disk space management is found to be more difficult than for standard B/sup trees. Two simple space-management schemes specifically designed for handling buckets of two different sizes are investigated. It is found that an overall storage utilization of 81% can be achieved in practice.