Geodetic Point-In-Polygon Query Processing in Oracle Spatial
暂无分享,去创建一个
[1] Hans-Peter Kriegel,et al. A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems , 1993, SSD.
[2] Yi Fang,et al. Spatial indexing in microsoft SQL server 2008 , 2008, SIGMOD Conference.
[3] Walid G. Aref,et al. On local heuristics to speed up polygon-polygon intersection tests , 1999, GIS '99.
[4] M. Goodchild,et al. Geographic Information Systems and Science (second edition) , 2001 .
[5] Kothuri Venkata Ravi Kanth,et al. Efficient Processing of Large Spatial Queries Using Interior Approximations , 2001, SSTD.
[6] Kothuri Venkata Ravi Kanth,et al. Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data , 2002, SIGMOD '02.
[7] J. O´Rourke,et al. Computational Geometry in C: Arrangements , 1998 .
[8] Chengyang Zhang,et al. Advances in Spatial and Temporal Databases , 2015, Lecture Notes in Computer Science.
[9] Timos K. Sellis,et al. Topological relations in the world of minimum bounding rectangles: a study with R-trees , 1995, SIGMOD '95.
[10] Joseph O'Rourke,et al. Computational Geometry in C. , 1995 .
[11] Max J. Egenhofer,et al. Advances in Spatial Databases , 1997, Lecture Notes in Computer Science.
[12] M. Goodchild,et al. Geographic Information Systems and Science (second edition) , 2005 .