The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - September-October (1997 vol.9)
pp: 826-832
ABSTRACT
<p><b>Abstract</b>—We consider a variant of B<super>+</super>-tree called the <it>B</it><super><it>+</it></super>-<it>tree with physical clustering</it> (BC), which is exemplified by VSAM key-sequenced datasets. In this file, logically contiguous data buckets are physically clustered in a storage unit called a <it>region</it> in order to enhance the efficiency of sequential processing. As a consequence, records in a bucket are redistributed over time according to two different split algorithms: <it>bucket split</it> and <it>region split</it>. A stochastic model of the disorganization of BC files is constructed using order statistics. Database administrators of on-line transaction systems often need to reorganize BC files before a region split occurs. An efficient algorithm for determining the optimal reorganization time of BC files is developed. Analytic results are validated by simulation. In passing, we discuss guidelines for load-time configuration of BC files.</p>
INDEX TERMS
B+-tree, dynamic indexed files, physical database, VSAM, stochastic model of file dynamics, file reorganization, order statistics, simulation.
CITATION
June S. Park, V. Sridhar, "Probabilistic Model and Optimal Reorganization of B+-Tree with Physical Clustering", IEEE Transactions on Knowledge & Data Engineering, vol.9, no. 5, pp. 826-832, September-October 1997, doi:10.1109/69.634758
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool