Query processing in spatial databases containing obstacles

Authors: Zhang, Jun¹; Papadias, Dimitris²; Mouratidis, Kyriakos²; Manli, Zhu³

Source: International Journal of Geographical Information Science, Volume 19, Number 10, Number 10/01Nov2005 , pp. 1091-1111(21)

Publisher: Taylor and Francis Ltd

Buy & download fulltext article:

Price: $55.77 plus tax (Refund Policy)

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

Document Type: Research article

DOI: http://dx.doi.org/10.1080/13658810500286935

Affiliations: 1: School of Computer Engineering, Nanyang Technological University, Nanyang Avenue, 639798, Singapore 2: Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong 3: Institute for Infocomm Research, 21 Heng Mui Keng Terrace, 119613, Singapore

Publication date: 2005-11-01

More about this publication?