DocumentCode :
2193082
Title :
A cost model for interval intersection queries on RI-trees
Author :
Kriegel, Hans-Peter ; Pfeifle, Marting ; Pötke, Marco ; Seidl, Thomas
Author_Institution :
Inst. for Comput. Sci., Univ. of Munich, Germany
fYear :
2002
fDate :
2002
Firstpage :
131
Lastpage :
141
Abstract :
The efficient management of interval data 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 interval intersection queries on top of existing object-relational database systems. The paper complements that approach by effective and efficient models to estimate the selectivity and the I/O cost of interval 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 cost to the actual cost of index scans ranges from 0% to 23%, depending on the resolution of the persistent statistics and the size of the query objects.
Keywords :
query processing; temporal databases; tree data structures; visual databases; Oracle database; RI-trees; access method; average relative error; cost model; cost-based optimizer; interval data management; interval intersection queries; object-relational database systems; relational interval tree; spatial database; statistics facilities; temporal database; Conference management; Costs; Databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Scientific and Statistical Database Management, 2002. Proceedings. 14th International Conference on
ISSN :
1099-3371
Print_ISBN :
0-7695-1632-7
Type :
conf
DOI :
10.1109/SSDM.2002.1029713
Filename :
1029713
Link To Document :
بازگشت