HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item:
Title: Spatial queries in the presence of obstacles
Authors: Zhang, Jun
Papadias, Dimitris
Mouratidis, Kyriakos
Zhu, Manli
Keywords: Database applications
Spatial query processing
Euclidean distance metric
Spatial database
Issue Date: Mar-2004
Citation: 9th International Conference on Exending Database Technology, p. 366-384 (LNCS 2992)
Abstract: 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.
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:
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
papadias8.pdfpre-published version186KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.