Early separation of filter and refinement steps in spatial query optimization

The spatial query has been processed in two steps, the filter step and the refinement step, due to the large volume and high complexity of the spatial data. However, this approach has been considered only in the query execution phase after completion of the query optimization phase. This paper presents query optimization strategies which take the characteristics of spatial databases into account. The first strategy is the separation of filter and refinement steps not in the query execution phase but in the query optimization phase. As the second strategy, several refinement operations can be combined in processing a complex query, and as the third strategy several filter operations can also be combined. We call the optimization technique utilizing these strategies the early separated filter and refinement (ESFAR). This paper also presents a rule-based optimization technique for ESFAR.

[1]  Walid G. Aref,et al.  Optimization for Spatial Query Processing , 1991, Very Large Data Bases Conference.

[2]  Jack A. Orenstein.  Spatial query processing in an object-oriented database system , 1986, SIGMOD '86.

[3]  Hanan Samet,et al.  Benchmarking Spatial Join Operations with Spatial Output , 1995, VLDB.

[4]  Hans-Peter Kriegel,et al.  Multi-step processing of spatial joins , 1994, SIGMOD '94.

[5]  Kyu-Young Whang,et al.  Query Optimization Techniques Utilizing Path Indexes in Object-Oriented Database Systems , 1997, DASFAA.

[6]  Abraham Silberschatz,et al.  Database System Concepts , 1980 .

[7]  Hans-Peter Kriegel,et al.  Efficient processing of spatial joins using R-trees , 1993, SIGMOD Conference.

[8]  Beng Chin Ooi,et al.  Extending a DBMS for geographic applications , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[9]  R. G. G. Cattell,et al.  The Object Database Standard: ODMG-93 , 1993 .

[10]  Yong-Ju Lee,et al.  T wo-step Index Structure for Complex Multi-dimensional Objects , 1998 .

[11]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[12]  Abraham Silberschatz,et al.  Database Systems Concepts , 1997 .

[13]  S. B. Yao,et al.  Approximating block accesses in database organizations , 1977, CACM.

[14]  Patrick Valduriez,et al.  Join indices , 1987, TODS.

[15]  Timos K. Sellis.  Review - Efficient Processing of Spatial Joins Using R-Trees , 2000, ACM SIGMOD Digit. Rev..

[16]  Ralf Hartmut Güting,et al.  Rule-based optimization and query processing in an extensible geometric database system , 1992, TODS.

[17]  Klaus R. Dittrich,et al.  Advances in Object-Oriented Database Systems , 1988, Lecture Notes in Computer Science.

[18]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[19]  Goetz Graefe,et al.  Experiences building the open OODB query optimizer , 1993, SIGMOD Conference.

[20]  Ismailcem Budak Arpinar,et al.  METU object-oriented DBMS , 1994, SIGMOD '94.

[21]  David Jordan,et al.  The Object Database Standard: ODMG 2.0 , 1997 .

[22]  Walid G. Aref,et al.  Spatial Data Models and Query Processing , 1995, Modern Database Systems.

[23]  M. W. Blasgen,et al.  Storage and Access in Relational Data Bases , 1977, IBM Syst. J..

[24]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[25]  Elke A. Rundensteiner,et al.  Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations , 1997, VLDB.

[26]  David J. DeWitt,et al.  OPT++ : an object-oriented implementation for extensible database query optimization , 1999, The VLDB Journal.

[27]  Elke A. Rundensteiner,et al.  A cost model for estimating the performance of spatial joins using R-trees , 1997, Proceedings. Ninth International Conference on Scientific and Statistical Database Management (Cat. No.97TB100150).

[28]  David J. DeWitt,et al.  Shoring up persistent applications , 1994, SIGMOD '94.

[29]  Bernd-Uwe Pagel,et al.  Towards an analysis of range query performance in spatial data structures , 1993, PODS '93.

[30]  C. Mohan,et al.  Single Table Access Using Multiple Indexes: Optimization, Execution, and Concurrency Control Techniques , 1990, EDBT.

[31]  GütingRalf Hartmut,et al.  Rule-based optimization and query processing in an extensible geometric database system , 1992 .

[32]  Chin-Wan Chung.  A query optimization in distributed database systems , 1983 .

[33]  Timos K. Sellis,et al.  A model for the prediction of R-tree performance , 1996, PODS.

[34]  Goetz Graefe,et al.  The Volcano optimizer generator: extensibility and efficient search , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[35]  David J. DeWitt,et al.  Building a scaleable geo-spatial DBMS: technology, implementation, and evaluation , 1997, SIGMOD '97.

[36]  David J. DeWitt,et al.  Partition based spatial-merge join , 1996, SIGMOD '96.