Skip to main content

Query processing in spatial databases containing obstacles

Buy Article:

$63.00 plus tax (Refund Policy)

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.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Data/Media
No Metrics

Keywords: Query processing; Spatial databases; Visibility graph

Document Type: Research Article

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?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more