Information-Associated Join Indices for Spatial Range Search

Abstract Spatial join indices are join indices constructed for spatial objects. Similar to join indices in relational database systems, spatial join indices improve efficiency of spatial join operations. In this paper, a spatial-information-associated join indexing mechanism is developed to speed up spatial queries, especially, spatial range queries. Three distance-associated join index structures: basic, ring-structured and hierarchical, are developed and studied. Such join indexing structures can be further extended to include orientation information for flexible applications, which leads to zone-structured and other spatial-information-associated join indices. Our performance study and analysis show that spatial-information-associated join indices substantially improve the performance of spatial queries and that different structures are best suited for different applications.

[1]  Jürg Nievergelt,et al.  The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.

[2]  Aris M. Ouksel,et al.  Multidimensional B-trees for associative searching in database systems , 1982, Inf. Syst..

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

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  Doron Rotem Spatial join indices , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[6]  Diane Greene,et al.  An implementation and performance analysis of spatial data access methods , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[7]  Jon Louis Bentley,et al.  Decomposable Searching Problems , 1979, Inf. Process. Lett..

[8]  David B. Lomet,et al.  The hB-tree: a multiattribute indexing method with good guaranteed performance , 1990, TODS.

[9]  Oliver Günther,et al.  Spatial database indices for large extended objects , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[10]  Peter Widmayer,et al.  The LSD tree: spatial access to multidimensional and non-point objects , 1989, VLDB 1989.

[11]  Frank Manola,et al.  PROBE Spatial Data Modeling and Query Processing in an Image Database Application , 1988, IEEE Trans. Software Eng..

[12]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[13]  Hans-Peter Kriegel,et al.  Techniques for Design and Implementation of Efficient Spatial Access Methods , 1988, VLDB.

[14]  Hans-Werner Six,et al.  The R-file: an efficient access structure for proximity queries , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

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

[16]  Hans-Werner Six,et al.  Spatial searching in geometric databases , 1988, Proceedings. Fourth International Conference on Data Engineering.

[17]  J. T. Robinson,et al.  The K-D-B-tree: a search structure for large multidimensional dynamic indexes , 1981, SIGMOD '81.