Publication Type

Conference Proceeding Article

Version

Postprint

Publication Date

3-2004

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.

Discipline

Databases and Information Systems | Numerical Analysis and Scientific Computing

Research Areas

Data Management and Analytics

Publication

Advances in database technology EDBT 2004: 9th International Conference on Extending Database Technology: Hērakleion, Crete, Greece, March 14-18, 2004: Proceedings

Volume

2992

First Page

366

Last Page

384

ISBN

9783540247418

Identifier

10.1007/978-3-540-24741-8_22

Publisher

Springer Verlag

City or Country

Berlin

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.1007/978-3-540-24741-8_22

Share

COinS