Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
Performance analysis of file organizations that use multi-bucket data leaves
Information Processing Letters
Analysis of bounded disorder file organization
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Performance of B±Trees with Partial Expansions
IEEE Transactions on Knowledge and Data Engineering
A Robust Multi-Attribute Search Structure
Proceedings of the Fifth International Conference on Data Engineering
| Hi-index | 0.00 |
We present an exact performance analysis, under random insertions, of file organizations that use multibucket data leaves and perform partial expansions before splitting. We evaluate the expected disk space utilization of the file and show how the expected search and insert costs can be estimated. The analytical results are confirmed by simulations. The analysis can be used to investigate both the dynamic and the asymptotic behaviors.