Extending a Spatial Access Structure to Support Additional Standard Attributes

In recent years, many access structures have been proposed supporting access to objects via their spatial location. However, additional non-geometric properties are always associated with geometric objects, and in practice it is often necessary to use select conditions based on spatial and standard attributes. An obvious idea to improve the performance of queries with mixed select conditions is to extend spatial access structures with additional dimensions for standard attributes. Whereas this idea seems to be simple and promising at first glance, a closer look brings up serious problems, especially with select conditions containing arithmetic expressions or select conditions for non-point objects and with Boolean operators like or and not.

[1]  Andreas Henrich A Distance Scan Algorithm for Spatial Access Structures , 1994, ACM-GIS.

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

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

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

[5]  Hans-Werner Six,et al.  Paging Binary Trees with External Balancing , 1989, WG.

[6]  Hans-Peter Kriegel,et al.  The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems , 1990, VLDB.

[7]  Jeff A. Bilmes,et al.  Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation , 1991, IEEE Trans. Knowl. Data Eng..

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

[9]  Klaus H. Hinrichs,et al.  A new algorithm for computing joins with grid files , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[10]  Klaus Hinrichs,et al.  The grid file system , 1985 .

[11]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[12]  Jean-Marc Thévenin,et al.  A Reliable Backend Using Multiattribute Clustering and Select-Join Operator , 1986, Very Large Data Bases Conference.

[13]  Andreas Henrich,et al.  Die Nutzung mehrdimensionaler Zugriffsstrukturen für Anfragen über Standardattributen , 1995, BTW.

[14]  Michael Freeston,et al.  The BANG file: A new kind of grid file , 1987, SIGMOD '87.

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

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

[17]  D. B. Lomet,et al.  A robust multi-attribute search structure , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[18]  Lee Naish,et al.  A Superjoin Algorithm for Deductive Databases , 1986, Foundations of Deductive Databases and Logic Programming..

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

[20]  Masaru Kitsuregawa,et al.  Join strategies on KD-tree indexed relations , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[21]  Hans-Werner Six,et al.  The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects , 1989, VLDB.

[22]  Ralf Hartmut Güting,et al.  Geo-Relational Algebra: A Model and Query Language for Geometric Database Systems , 1988, EDBT.

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

[24]  Ralf Hartmut Güting,et al.  Gral: An Extensible Relational Database System for Geometric Applications , 1989, VLDB.