Distance queries for complex spatial objects in oracle spatial

With the proliferation of global positioning systems (GPS) enabled devices, a growing number of database systems are capable of storing and querying different spatial objects including points, polylines and polygons. In this paper, we present our experience with supporting one important class of spatial queries in these database systems: distance queries. For example, a traveler may want to find hotels within 500 meters of a nearby beach. In addition, this paper presents new techniques implemented in Oracle Spatial for some distance-related problems, such as the maximum distance between complex spatial objects, and the diameter, the convex hull and the minimum bounding circle of complex spatial objects. We conduct our experiments by utilizing real-world data sets and demonstrate that these distance and distance-related queries can be significantly improved.

[1]  Yannis Manolopoulos,et al.  Closest pair queries in spatial databases , 2000, SIGMOD 2000.

[2]  G. Toussaint.  Solving geometric problems with the rotating calipers , 1983 .

[3]  Dana H. Ballard,et al.  Strip trees: a hierarchical representation for curves , 1981, CACM.

[4]  Hanan Samet,et al.  Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.

[5]  Kothuri Venkata Ravi Kanth,et al.  Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data , 2002, SIGMOD '02.

[6]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[7]  Jon G. Rokne.  AN EASY BOUNDING CIRCLE , 1991 .

[8]  Brian Everitt,et al.  Cluster analysis , 1974 .

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

[10]  Siva Ravada,et al.  ACM SIGSPATIAL GIS Cup 2013: geo-fencing , 2013, SIGSPATIAL/GIS.

[11]  Weiwei Sun,et al.  Quick geo-fencing using trajectory partitioning and boundary simplification , 2013, SIGSPATIAL/GIS.

[12]  T. Vincenty.  DIRECT AND INVERSE SOLUTIONS OF GEODESICS ON THE ELLIPSOID WITH APPLICATION OF NESTED EQUATIONS , 1975 .

[13]  Keith Ryden,et al.  OpenGIS ® Implementation Specification for Geographic information - Simple feature access - Part 1:Common architecture , 2005 .

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

[15]  Hanan Samet,et al.  Incremental distance join algorithms for spatial databases , 1998, SIGMOD '98.

[16]  Haibo Chen,et al.  Point-polygon topological relationship query using hierarchical indices , 2013, SIGSPATIAL/GIS.

[17]  Sean Quinlan,et al.  Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[18]  B. Everitt,et al.  Cluster Analysis: Everitt/Cluster Analysis , 2011 .

[19]  Hans-Peter Kriegel,et al.  Geodetic Distance Queries on R-Trees for Indexing Geographic Data , 2013, SSTD.

[20]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[21]  Siva Ravada,et al.  Topological relationship query processing for complex regions in Oracle Spatial , 2012, SIGSPATIAL/GIS.

[22]  Jesús Manuel Almendros-Jiménez,et al.  A performance comparison of distance-based query algorithms using R-trees in spatial databases , 2007, Inf. Sci..

[23]  Siva Ravada,et al.  Supporting topological relationship queries for complex line and collection geometries in oracle spatial , 2013, SIGSPATIAL/GIS.

[24]  Yannis Manolopoulos,et al.  R-Trees: Theory and Applications , 2005, Advanced Information and Knowledge Processing.

[25]  Siva Ravada,et al.  Geodetic Point-In-Polygon Query Processing in Oracle Spatial , 2011, SSTD.

[26]  Edward P. F. Chan.  Buffer Queries , 2003, IEEE Trans. Knowl. Data Eng..

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

[28]  Hans-Peter Kriegel,et al.  A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems , 1993, SSD.

[29]  Hans-Peter Kriegel,et al.  Boosting spatial pruning: on optimal pruning of MBRs , 2010, SIGMOD Conference.

[30]  Hanan Samet,et al.  An Incremental Hausdorff Distance Calculation Algorithm , 2011, Proc. VLDB Endow..

[31]  Hanan Samet,et al.  Distance browsing in spatial databases , 1999, TODS.