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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Badawy, W.M., Aref, W.G.: On Local Heuristics to Speed Up Polygon-Polygon Intersection Tests. In: ACM-GIS 1999, pp. 97–102 (1999)
Brinkhoff, T., Horn, H., Kriegel, H.-P., Schneider, R.: A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems. In: Abel, D.J., Ooi, B.-C. (eds.) SSD 1993. LNCS, vol. 692, pp. 357–376. Springer, Heidelberg (1993)
IBM Informix, IBM Informix Geodetic DataBlade Module User’s Guide Version 3.12 (2007)
Fang, Y., Friedman, M., Nair, G., Rys, M., Schmid, A.-E.: Spatial indexing in Microsoft SQL server 2008. In: SIGMOD Conference 2008, pp. 1207–1216 (2008)
Kothuri, R.K., Ravada, S.: Efficient Processing of Large Spatial Queries Using Interior Approximations. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 404–424. Springer, Heidelberg (2001)
Kothuri, R.K., Ravada, S., Abugov, D.: Quadtree and R-tree Indexes in Oracle Spatial: A Comparison Using GIS Data. In: SIGMOD Conference 2002, pp. 546–557 (2002)
Longley, P.A., Goodchild, M.F., Maguire, D.J., Rhind, D.W.: Geographic Information Systems and Science. John Wiley & Sons Ltd, West Sussex (2005)
Microsoft SQL Server, Spatial Indexing Overview, http://technet.microsoft.com/en-us/library/bb964712.aspx
Oracle Spatial, Oracle® Spatial Developer’s Guide 11g Release 2 (11.2), Part Number E11830-07 (2010)
O’Rourke, J.: Computational Geometry in C. Cambridge University Press, Cambridge (1998)
Papadias, D., Theodoridis, Y., Sellis, T.K., Egenhofer, M.J.: Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-trees. In: SIGMOD Conference 1995, pp. 92–103 (1995)
PostGIS Geography, http://postgis.refractions.net/docs/ch04.html#PostGIS_Geography
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, Y., Ravada, S., Anderson, R. (2011). Geodetic Point-In-Polygon Query Processing in Oracle Spatial. In: Pfoser, D., et al. Advances in Spatial and Temporal Databases. SSTD 2011. Lecture Notes in Computer Science, vol 6849. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22922-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-22922-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22921-3
Online ISBN: 978-3-642-22922-0
eBook Packages: Computer ScienceComputer Science (R0)