The Community for Technology Leaders
Green Image
ABSTRACT
<p><b>Abstract</b>—Existing analysis for R-trees is inadequate for several traditional and emerging applications including, for example, temporal, spatio-temporal, and multimedia databases because it is based on the assumption that the extents of a node are identical on all dimensions, which is not satisfied in these domains. In this paper, we propose analytical models that can accurately predict R*-tree performance without this assumption. Our derivation is based on the novel concept of extent regression function, which computes the node extents as a function of the number of node splits. Detailed experimental evaluation reveals that the proposed models are accurate, even in cases where previous methods fail completely.</p>
INDEX TERMS
Database, spatial database, R-tree, cost model.
CITATION

D. Papadias and Y. Tao, "Performance Analysis of R*-Trees with Arbitrary Node Extents," in IEEE Transactions on Knowledge & Data Engineering, vol. 16, no. , pp. 653-668, 2004.
doi:10.1109/TKDE.2004.13
78 ms
(Ver 3.3 (11022016))