Please use this identifier to cite or link to this item:

Spatial queries in the presence of obstacles

Authors Zhang, J.
Papadias, D. View this author's profile
Mouratidis, K.
Zhu, M. HKUST affiliated (currently or previously)
Issue Date 2004
Source Lecture Notes in Computer Science , v. 2992, 2004, p. 366-384
Summary Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are directly reachable. 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 neighbors, e-distance joins and closest pairs, considering that both data objects and obstacles are indexed by R-trees. The effectiveness of the proposed solutions is verified through extensive experiments.
ISSN 0302-9743
Rights The original publication is available at Please use the appropriate URL and/or DOI for the article.The access script to link to it is:
Language English
Format Article
Access View full-text via Web of Science
View full-text via Scopus
Files in this item:
File Description Size Format
papadias8.pdf 190504 B Adobe PDF