作者: Jun Zhang , Dimitris Papadias , Kyriakos Mouratidis , Manli Zhu
DOI: 10.1007/978-3-540-24741-8_22
关键词:
摘要: Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes Euclidean distance metric assuming that points space are directly reachable. In this paper, we study queries presence obstacles, where obstructed between two is defined as length shortest path connects them without crossing any obstacles. We propose efficient algorithms for most important types, namely, range search, nearest neighbors, e-distance joins and closest pairs, considering both data objects indexed by R-trees. The effectiveness proposed solutions verified through extensive experiments.