The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - June (1989 vol.1)
pp: 248-257
ABSTRACT
<p>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.</p>
INDEX TERMS
performance; mathematical analysis; asymptotic behaviour; disk space management; buckets handling; B/sup trees; partial expansions; behavior; file structure; random insertions; expected storage utilization; expected cost; insertions; dynamic behavior; simulation; space-management schemes; storage utilization; data structures
CITATION
R.A. Baeza-Yates, P.-A. Larson, "Performance of B±Trees with Partial Expansions", IEEE Transactions on Knowledge & Data Engineering, vol.1, no. 2, pp. 248-257, June 1989, doi:10.1109/69.87964
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool