Geodetic Point-In-Polygon Query Processing in Oracle Spatial

  • Ying Hu
  • Siva Ravada
  • Richard Anderson
Conference paper

DOI: 10.1007/978-3-642-22922-0_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6849)
Cite this paper as:
Hu Y., Ravada S., Anderson R. (2011) Geodetic Point-In-Polygon Query Processing in Oracle Spatial. In: Pfoser D. et al. (eds) Advances in Spatial and Temporal Databases. SSTD 2011. Lecture Notes in Computer Science, vol 6849. Springer, Berlin, Heidelberg

Abstract

As Global Positioning Systems (GPSs) are increasingly ubiquitous, spatial database systems are also encountering increasing use of location or point data, which is often expressed in geodetic coordinates: longitude and latitude. A simple but very important question regarding this data is whether the locations lie within a given region. This is normally called the point-in-polygon (PIP) problem. Within the Geodetic space, PIP queries have additional challenges that are not present in the Cartesian space. In this paper, we discuss several techniques implemented in Oracle Spatial to speed up geodetic PIP query processing. Our experiments utilizing real-world data sets demonstrate the PIP query performance can be significantly improved using these new techniques.

Keywords

Point-In-Polygon Geodetic Data Spatial Databases R-tree 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ying Hu
  • Siva Ravada
  • Richard Anderson

There are no affiliations available

Personalised recommendations