Despite the existence of obstacles in many database applications, traditional spatial query processing assumes that points in space are directly reachable and utilizes the Euclidean distance metric. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance between two points is defined as the length of the shortest path that connects them without crossing any obstacles. We propose efficient algorithms for the most important query types, namely, range search, nearest neighbours, e-distance joins, closest pairs and distance semi-joins, assuming that both data objects and obstacles are indexed by R-trees. The effectiveness of the proposed solutions is verified through extensive experiments.
spatial databases, query processing, visibility graph
Databases and Information Systems | Numerical Analysis and Scientific Computing
Data Management and Analytics
International Journal of Geographical Information Science
Taylor and Francis
ZHANG, Jun; Papadias, Dimitris; Mouratidis, Kyriakos; and ZHU, Manli.
Query Processing in Spatial Databases Containing Obstacles. (2005). International Journal of Geographical Information Science. 19, (10), 1091-1111. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/174
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.