Publication Type
Journal Article
Version
publishedVersion
Publication Date
11-2005
Abstract
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.
Keywords
spatial databases, query processing, visibility graph
Discipline
Databases and Information Systems | Numerical Analysis and Scientific Computing
Publication
International Journal of Geographical Information Science
Volume
19
Issue
10
First Page
1091
Last Page
1111
ISSN
1365-8816
Identifier
10.1080/13658810500286935
Publisher
Taylor and Francis
Citation
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.
Available at: https://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 International License.
Additional URL
http://dx.doi.org/10.1080/13658810500286935
Included in
Databases and Information Systems Commons, Numerical Analysis and Scientific Computing Commons