This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Novel Dual-Index Design to Efficiently Support Snapshot Location-Based Query Processing in Mobile Environments
September 2010 (vol. 9 no. 9)
pp. 1280-1292
Haojun Wang, University of Southern California, Los Angeles
Roger Zimmermann, National University of Singapore, Singapore
Location-based services are increasingly popular recently. Many applications aim to support a large number of users in metro area (i.e., dense networks). To cope with this challenge, we present a framework that supports location-based services on MOVing objects in road Networks (MOVNet, for short) [CHECK END OF SENTENCE]. 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. In this paper, we extend the functionality of MOVNet to support snapshot range queries as well as snapshot k nearest neighbor queries. Given an arbitrary edge in the space, we analyze the minimum and maximum number of grid cells that are possibly affected. We show that the maximum bound can be used in snapshot range query processing to prune the search space. We demonstrate via theoretical analysis and experimental results that MOVNet yields excellent performance with various networks while scaling to a very large number of moving objects.

[1] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R∗-Tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD, 1990.
[2] J. Bresenham, "Algorithm for Computer Control of a Digital Plotter," IBM Systems J., vol. 4, no. 1, pp. 25-30, 1965.
[3] T. Brinkhoff, "A Framework for Generating Network-Based Moving Objects," GeoInformatica, vol. 6, no. 2, pp. 153-180, 2002.
[4] H.-J. Cho and C.-W. Chung, "An Efficient and Scalable Approach to CNN Queries in a Road Network," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2005.
[5] H.D. Chon, D. Agrawal, and A.E. Abbadi, "Range and kNN Query Processing for Moving Objects in Grid Model," Mobile Networks and Applications, vol. 8, no. 4, pp. 401-412, 2003.
[6] E. Dijkstra, "A Note on Two Problems in Connection with Graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
[7] B. Gedik and L. Liu, "MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System," Proc. Ninth Int'l Conf. Extending Database Technology (EDBT), 2004.
[8] H. Hu, D.L. Lee, and V.C.S. Lee, "Distance Indexing on Road Networks," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2006.
[9] H. Hu, J. Xu, and D.L. Lee, "A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects," Proc. ACM SIGMOD, 2005.
[10] X. Huang, C.S. Jensen, H. Lu, and S. Saltenis, "S-GRID: A Versatile Approach to Efficient Query Processing in Spatial Networks," Proc. 10th Int'l Symp. Spatial and Temporal Databases (SSTD), 2007.
[11] X. Huang, C.S. Jensen, and S. Saltenis, "The Islands Approach to Nearest Neighbor Querying in Spatial Networks," Proc. Int'l Symp. Spatial and Temporal Databases (SSTD), 2005.
[12] C.S. Jensen, J. Kolárvr, T.B. Pedersen, and I. Timko, "Nearest Neighbor Queries in Road Networks," Proc. 11th ACM Int'l Symp. Advances in Geographic Information Systems (GIS), 2003.
[13] C.S. Jensen, D. Lin, and B.C. Ooi, "Query and Update Efficient B+-Tree Based Indexing of Moving Objects," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2004.
[14] M.R. Kolahdouzan and C. Shahabi, "Continuous K-Nearest Neighbor Queries in Spatial Network Databases," Proc. Second Workshop Spatio-Temporal Database Management (STDBM), 2004.
[15] M.R. Kolahdouzan and C. Shahabi, "Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2004.
[16] D. Kwon, S. Lee, and S. Lee, "Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree," Proc. Third Int'l Conf. Mobile Data Management (MDM), 2002.
[17] M.-L. Lee, W. Hsu, C.S. Jensen, B. Cui, and K.L. Teo, "Supporting Frequent Updates in R-Trees: A Bottom-Up Approach," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2003.
[18] M.F. Mokbel, X. Xiong, and W.G. Aref, "SINA: Scalable Incremental Processing of Continuous Queries in Spatio-Temporal Databases," Proc. ACM SIGMOD, 2004.
[19] K. Mouratidis, M. Hadjieleftheriou, and D. Papadias, "Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring," Proc. ACM SIGMOD, 2005.
[20] K. Mouratidis, M.L. Yiu, D. Papadias, and N. Mamoulis, "Continuous Nearest Neighbor Monitoring in Road Networks," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2006.
[21] D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, "Query Processing in Spatial Network Databases," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2003.
[22] J.M. Patel, Y. Chen, and V.P. Chakka, "STRIPES: An Efficient Index for Predicted Trajectories," Proc. ACM SIGMOD, 2004.
[23] S. Saltenis, C.S. Jensen, S.T. Leutenegger, and M.A. Lopez, "Indexing the Positions of Continuously Moving Objects," Proc. ACM SIGMOD, 2000.
[24] Y. Tao, D. Papadias, and J. Sun, "The TPR∗-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2003.
[25] G.E. Taylor, G. Blewitt, D. Steup, S. Corbett, and A. Car, "Road Reduction Filtering for GPS-GIS Navigation," Trans. GIS, vol. 5, pp. 193-207, 2001.
[26] H. Wang and R. Zimmermann, "Snapshot Location-Based Query Processing on Moving Objects in Road Networks," Proc. 16th ACM Int'l Conf. Advances in Geographic Information Systems (GIS), 2008.
[27] H. Wang, R. Zimmermann, and W.-S. Ku, "ASPEN: An Adaptive Spatial Peer-to-Peer Network," Proc. 13th ACM Int'l Workshop Geographic Information Systems (ACM-GIS), pp. 230-239, 2005.
[28] X. Xiong, M.F. Mokbel, and W.G. Aref, "SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-Temporal Databases," Proc. Int'l Conf. Data Eng. (ICDE), 2005.
[29] X. Xiong, M.F. Mokbel, and W.G. Aref, "LUGrid: Update-Tolerant Grid-Based Indexing for Moving Objects," Proc. Seventh Int'l Conf. Mobile Data Management (MDM), 2006.
[30] X. Yu, K.Q. Pu, and N. Koudas, "Monitoring k-nearest Neighbor Queries over Moving Objects," Proc. Int'l Conf. Data Eng. (ICDE), 2005.

Index Terms:
Spatial databases, GIS, Location-dependent, sensitive.
Citation:
Haojun Wang, Roger Zimmermann, "A Novel Dual-Index Design to Efficiently Support Snapshot Location-Based Query Processing in Mobile Environments," IEEE Transactions on Mobile Computing, vol. 9, no. 9, pp. 1280-1292, Sept. 2010, doi:10.1109/TMC.2010.63
Usage of this product signifies your acceptance of the Terms of Use.