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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asano, T., Guibas, L., Hershberger, J., Imai, H.: Visibility of Disjoint Polygons. Algorithmica 1, 49–63 (1986)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, pp. 305–315. Springer, Heidelberg (1997)
Brinkhoff, T., Kriegel, H., Seeger, B.: Efficient Processing of Spatial Joins Using R-trees. In: SIGMOD (1993)
Becker, B., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method. In: SIGMOD (1990)
Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest Pair Queries in Spatial Databases. In: SIGMOD (2000)
Dijkstra, E.: A Note on Two Problems in Connection with Graphs. Numeriche Mathematik 1, 269–271 (1959)
Estivill-Castro, V., Lee, I.: Fast Spatial Clustering with Different Metrics in the Presence of Obstacles. In: ACM GIS (2001)
Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD (1984)
Ghosh, S., Mount, D.: An Output Sensitive Algorithm for Computing Visibility Graphs. In: FOCS (1987)
Hjaltason, G., Samet, H.: Incremental Distance Join Algorithms for Spatial Databases. In: SIGMOD (1998)
Hjaltason, G., Samet, H.: Distance Browsing in Spatial Databases. TODS 24(2), 265–318 (1999)
Kung, R., Hanson, E., Ioannidis, Y., Sellis, T., Shapiro, L., Stonebraker, M.: Heuristic Search in Data Base Systems. Expert Database Systems (1986)
Lozano-Pérez, T., Wesley, M.: An Algorithm for Planning Collision-free Paths among Polyhedral Obstacles. CACM 22(10), 560–570 (1979)
Pocchiola, M., Vegter, G.: Minimal Tangent Visibility Graph. Computational Geometry: Theory and Applications (1995)
Pocchiola, M., Vegter, G.: Topologically Sweeping Visibility Complexes via Pseudo-triangulations. Discrete Computational Geometry (1996)
Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: VLDB (2003)
Rivière, S.: Topologically Sweeping the Visibility Complex of Polygonal Scenes. In: Symposium on Computational Geometry (1995)
Sellis, T., Roussopoulos, N., Faloutsos, C.: The R+-tree: a Dynamic Index for Multi-Dimensional Objects. In: VLDB (1987)
Sharir, M., Schorr, A.: On Shortest Paths in Polyhedral Spaces. In: STOC (1984)
Tung, A., Hou, J., Han, J.: Spatial Clustering in the Presence of Obstacles. In: ICDE (2001)
Welzl, E.: Constructing the Visibility Graph for n Line Segments in O(\({\it n}^2\)) Time. Information Processing Letters 20, 167–171 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, J., Papadias, D., Mouratidis, K., Zhu, M. (2004). Spatial Queries in the Presence of Obstacles. In: Bertino, E., et al. Advances in Database Technology - EDBT 2004. EDBT 2004. Lecture Notes in Computer Science, vol 2992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24741-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-24741-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21200-3
Online ISBN: 978-3-540-24741-8
eBook Packages: Springer Book Archive