Object-Based Directional Query Processing in Spatial Databases

Direction-based spatial relationships are critical in many domains, including geographic information systems (GIS) and image interpretation. They are also frequently used as selection conditions in spatial queries. In this paper, we explore the processing of object-based direction queries and propose a new open shape-based strategy (OSS). OSS models the direction region as an open shape and converts the processing of the direction predicates into the processing of topological operations between open shapes and closed geometry objects. The proposed strategy OSS makes it unnecessary to know the boundary of the embedding world and also eliminates the computation related to the world boundary. OSS reduces both I/O and CPU costs by greatly improving the filtering effectiveness. Our experimental evaluation shows that OSS consistently outperforms classical range query strategies (RQS) while the degree of performance improvement varies by several parameters. Experimental results also demonstrate that OSS is more scalable than RQS for large data sets.

[1]  Wolfgang Wahlster,et al.  Coping with Static and Dynamic Spatial Relations , 2003 .

[2]  Shashi Shekhar,et al.  Spatial Databases - Accomplishments and Research Needs , 1999, IEEE Trans. Knowl. Data Eng..

[3]  Shashi Shekhar,et al.  Processing Object-Orientation-Based Direction Queries in Spatial Databases , 2000 .

[4]  Dimitris Papadias,et al.  Hierarchical reasoning about direction relations , 1996, GIS '96.

[5]  Shashi Shekhar,et al.  Data models in geographic information systems , 1997, CACM.

[6]  Christian Freksa,et al.  Using Orientation Information for Qualitative Spatial Reasoning , 1992, Spatio-Temporal Reasoning.

[7]  Chang Ye-In,et al.  A Prime-Number-based Matrix strategy for efficient iconic indexing of symbolic pictures☆ , 1997 .

[8]  Ralf Hartmut Güting,et al.  An introduction to spatial database systems , 1994, VLDB J..

[9]  Timos K. Sellis,et al.  Qualitative representation of spatial knowledge in two-dimensional space , 1994, The VLDB Journal.

[10]  Shashi Shekhar,et al.  Direction as a spatial object: a summary of results , 1998, GIS '98.

[11]  Timos K. Sellis,et al.  Efficient Cost Models for Spatial Queries Using R-Trees , 2000, IEEE Trans. Knowl. Data Eng..

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

[13]  Donna Peuquet,et al.  An algorithm to determine the directional relationship between arbitrarily-shaped polygons in the plane , 1987, Pattern Recognit..

[14]  Gudula Retz-Schmidt,et al.  Various Views on Spatial Prepositions , 1988, AI Mag..

[15]  Yannis Theodoridis,et al.  Supporting Direction Relations in Spatial Database systems , 1996 .

[16]  P. W. Huang,et al.  Using 2D C+-strings as spatial knowledge representation for image database systems , 1994, Pattern Recognit..

[17]  Timos K. Sellis,et al.  The Retrieval of Direction Relations using R-trees , 1994, DEXA.