An Efficient Technique for Distance Computation in Road Networks

With recent advances in wireless communication and position technologies, it became possible to collect and record trajectories of moving objects. Thus, many services in road networks such as nearest neighbor querying and the analysis of moving objects trajectories come into sight which present challenges to the database community. The essential part of the queries behind these services is related to the distance computation in road networks. In this paper, we focus on this problem and propose a method for distance computation in road networks including the access of network connectivity information. We present an algorithm called circle which returns all moving objects within a given distance (radius) to a given network position during some time intervals in the past. We choose an existed index structure, the MON-Tree, to record the framework presented in this paper which is to store and query network connectivity information. The circle operator is used to experimentally evaluate our approach. The results show that the performance of the technique presented in this paper outperforms the only existing index structure in the literature capable to support this kind of query.

[1]  Lien Fa Lin,et al.  Continuous nearest neighbor search , 2008 .

[2]  Kyriakos Mouratidis,et al.  A threshold-based algorithm for continuous monitoring of k nearest neighbors , 2005, IEEE Transactions on Knowledge and Data Engineering.

[3]  Cyrus Shahabi,et al.  Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases , 2004, VLDB.

[4]  H. Miller,et al.  Geographic Information Systems for Transportation: Principles and Applications , 2001 .

[5]  Torben Bach Pedersen,et al.  Integrated Data Management for Mobile Services in the Real World , 2003, VLDB.

[6]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.

[7]  Dimitris Papadias,et al.  Aggregate nearest neighbor queries in road networks , 2005, IEEE Transactions on Knowledge and Data Engineering.

[8]  Cyrus Shahabi,et al.  A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases , 2002, GIS '02.

[9]  Nikos Pelekis,et al.  Nearest Neighbor Search on Moving Object Trajectories , 2005, SSTD.

[10]  Ouri Wolfson,et al.  A Spatiotemporal Model and Language for Moving Objects on Road Networks , 2001, SSTD.

[11]  Yufei Tao,et al.  Continuous Nearest Neighbor Search , 2002, VLDB.

[12]  Yufei Tao,et al.  Query Processing in Spatial Network Databases , 2003, VLDB.

[13]  Ralf Hartmut Güting,et al.  Indexing the Trajectories of Moving Objects in Networks* , 2004, GeoInformatica.

[14]  Torben Bach Pedersen,et al.  Nearest neighbor queries in road networks , 2003, GIS '03.

[15]  Torben Bach Pedersen,et al.  Data Modeling for Mobile Services in the Real World , 2003, SSTD.

[16]  Ouri Wolfson,et al.  A Spatiotemporal Query Language for Moving Objects on Road Networks , 2001 .

[17]  Xiang Li,et al.  Indexing network‐constrained trajectories for connectivity‐based queries , 2006, Int. J. Geogr. Inf. Sci..

[18]  Ralf Hartmut Güting,et al.  Modeling and querying moving objects in networks , 2006, The VLDB Journal.

[19]  Kyriakos Mouratidis,et al.  Continuous nearest neighbor monitoring in road networks , 2006, VLDB.