Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
Kriegel, H.-P., Pötke, M., Seidl, T.: Interval Sequences: An Object-Relational Approach to Manage Spatial Data. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 481–501. Springer, Heidelberg (2001)
Lomet, D.: B-tree Page Size When Caching is Considered. ACM SIGMOD Record 27(3), 28–32 (1998)
Theodoridis, Y., Stefanakis, E., Sellis, T.: Efficient Cost Models for Spatial Queries Using R-Trees. IEEE Transactions on Knowledge and Data Engineering 12(1), 19–32 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kriegel, HP., Pfeifle, M., Pötke, M., Seidl, T. (2004). A Cost Model for Spatial Intersection Queries on RI-Trees. In: Lee, Y., Li, J., Whang, KY., Lee, D. (eds) Database Systems for Advanced Applications. DASFAA 2004. Lecture Notes in Computer Science, vol 2973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24571-1_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-24571-1_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21047-4
Online ISBN: 978-3-540-24571-1
eBook Packages: Springer Book Archive