A Cost Model for Spatial Intersection Queries on RI-Trees

  • Hans-Peter Kriegel
  • Martin Pfeifle
  • Marco Pötke
  • Thomas Seidl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2973)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Lomet, D.: B-tree Page Size When Caching is Considered. ACM SIGMOD Record 27(3), 28–32 (1998)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Hans-Peter Kriegel
    • 1
  • Martin Pfeifle
    • 1
  • Marco Pötke
    • 2
  • Thomas Seidl
    • 3
  1. 1.University of Munich 
  2. 2.sd&m AG software design & management 
  3. 3.RWTH Aachen University 

Personalised recommendations