Please use this identifier to cite or link to this item:

Query Processing in Spatial Network Databases

Authors Papadias, Dimitris
Zhang, Jun
Mamoulis, Nikos
Tao, Yufei
Issue Date 2003
Source Proceedings of the Very Large Data Bases Conference (VLDB), Berlin, September 9-12 , Morgan Kaufmann, pp. 802-813
Summary Despite the importance of spatial networks in real-life applications, most of the spatial database literature focuses on Euclidean spaces. In this paper we propose an architecture that integrates network and Euclidean information, capturing pragmaatic constraints. Based on this architecture, we develop a Euclidean restriction and a network expansion framework that take advantage of location and connectivity to efficiently prune the search space. These frameworks are successfully applied to the most popular spatial queries, namely nearest neighbors, range search, closest pairs and e-distance joins, in the context of spatial network databases.
Rights This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder
Language English
Format Conference paper
Files in this item:
File Description Size Format
VLDB03SNDB.pdf 449864 B Adobe PDF