A Cost Model for Spatial Intersection Queries on RI-Trees
The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree), an efficient access method has been proposed to process intersection queries of spatial objects encoded by interval sequences on top of existing object-relational database systems. This paper complements that approach by effective and efficient models to estimate the selectivity and the I/O cost of interval sequence intersection queries in order to guide the cost-based optimizer whether and how to include the RI-tree into the execution plan. By design, the models immediately fit to common extensible indexing/ optimization frameworks, and their implementations exploit the built-in statistics facilities of the database server. According to our experimental evaluation on an Oracle database, the average relative error of the estimated query results and costs lies in the range of 0% to 32%, depending on the size and the structural complexity of the query objects.
Unable to display preview. Download preview PDF.
- 1.Kriegel, H.-P., Pfeifle, M., Pötke, M., Seidl, T.: A Cost Model for Interval Sequence Intersection Queries on RI-Trees. Technical Report, University of Munich (2003)Google Scholar
- 2.Kriegel, H.-P., Pfeifle, M., Pötke, M., Seidl, T.: A Cost Model for Interval Intersection Queries on RI-Trees. In: Proc. 14th Int. Conf. on Scientific and Statistical Database Management (SSDBM), pp. 131–141 (2002)Google Scholar
- 3.Kriegel, H.-P., Pötke, M., Seidl, T.: Managing Intervals Efficiently in Object-Relational Databases. In: Proc. 26th Int. Conf. on Very Large Databases (VLDB), pp. 407–418 (2000)Google Scholar