Snapshot location-based query processing on moving objects in road networks

Location-based services are increasingly popular and it is a key challenge to efficiently support query processing. We present a novel design to process large numbers of location-based snapshot queries on MOVing objects in road Networks (MOVNet, for short). MOVNet's dual-index design utilizes an on-disk R-tree to store the network connectivities and an in-memory grid structure to maintain moving object position updates. A method to speedily compute the overlapping grid cells in the network relates these two indices. Based on the above features we propose algorithms to support mobile network distance range queries. We demonstrate via experimental results that MOVNet yields excellent performance while scaling to a very large number of moving objects.

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

[2]  Ling Liu,et al.  MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System , 2004, EDBT.

[3]  Jack Bresenham,et al.  Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..

[4]  Jignesh M. Patel,et al.  STRIPES: an efficient index for predicted trajectories , 2004, SIGMOD '04.

[5]  Christian S. Jensen,et al.  The Islands Approach to Nearest Neighbor Querying in Spatial Networks , 2005, SSTD.

[6]  Kyriakos Mouratidis,et al.  Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring , 2005, SIGMOD '05.

[7]  Mong-Li Lee,et al.  Supporting Frequent Updates in R-Trees: A Bottom-Up Approach , 2003, VLDB.

[8]  Jianliang Xu,et al.  A generic framework for monitoring continuous spatial queries over moving objects , 2005, SIGMOD '05.

[9]  Walid G. Aref,et al.  SEA-CNN: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases , 2005, 21st International Conference on Data Engineering (ICDE'05).

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

[11]  Chin-Wan Chung,et al.  An Efficient and Scalable Approach to CNN Queries in a Road Network , 2005, VLDB.

[12]  Sukho Lee,et al.  Indexing the current positions of moving objects using the lazy update R-tree , 2002, Proceedings Third International Conference on Mobile Data Management MDM 2002.

[13]  Elias Frentzos,et al.  Indexing Objects Moving on Fixed Networks , 2003, SSTD.

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

[15]  Walid G. Aref,et al.  LUGrid: Update-tolerant Grid-based Indexing for Moving Objects , 2006, 7th International Conference on Mobile Data Management (MDM'06).

[16]  Cyrus Shahabi,et al.  Alternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Network Databases , 2005, STDBM.

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

[18]  Beng Chin Ooi,et al.  Query and Update Efficient B+-Tree Based Indexing of Moving Objects , 2004, VLDB.

[19]  Christian S. Jensen,et al.  Indexing the positions of continuously moving objects , 2000, SIGMOD '00.

[20]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[21]  Roger Zimmermann,et al.  ASPEN: an adaptive spatial peer-to-peer network , 2005, GIS '05.

[22]  Xiaohui Yu,et al.  Monitoring k-nearest neighbor queries over moving objects , 2005, 21st International Conference on Data Engineering (ICDE'05).

[23]  Walid G. Aref,et al.  SINA: scalable incremental processing of continuous queries in spatio-temporal databases , 2004, SIGMOD '04.

[24]  Victor C. S. Lee,et al.  Distance indexing on road networks , 2006, VLDB.

[25]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[26]  Thomas Brinkhoff,et al.  A Framework for Generating Network-Based Moving Objects , 2002, GeoInformatica.

[27]  Divyakant Agrawal,et al.  Range and kNN Query Processing for Moving Objects in Grid Model , 2003, Mob. Networks Appl..

[28]  Jimeng Sun,et al.  The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries , 2003, VLDB.

[29]  Hua Lu,et al.  S-GRID: A Versatile Approach to Efficient Query Processing in Spatial Networks , 2007, SSTD.

[30]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.