This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Processing of Continuous Location-Based Range Queries on Moving Objects in Road Networks
July 2011 (vol. 23 no. 7)
pp. 1065-1078
ASCII Text
x 
 
Haojun Wang, Roger Zimmermann, "Processing of Continuous Location-Based Range Queries on Moving Objects in Road Networks," IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 7, pp. 1065-1078, July, 2011.
 
 
BibTex
x
 
@article{ 10.1109/TKDE.2010.171,
author = {Haojun Wang and Roger Zimmermann},
title = {Processing of Continuous Location-Based Range Queries on Moving Objects in Road Networks},
journal ={IEEE Transactions on Knowledge and Data Engineering},
volume = {23},
number = {7},
issn = {1041-4347},
year = {2011},
pages = {1065-1078},
doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.171},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Knowledge and Data Engineering
TI - Processing of Continuous Location-Based Range Queries on Moving Objects in Road Networks
IS - 7
SN - 1041-4347
SP1065
EP1078
EPD - 1065-1078
A1 - Haojun Wang,
A1 - Roger Zimmermann,
PY - 2011
KW - Spatial databases and GIS
KW - location-dependent and sensitive.
VL - 23
JA - IEEE Transactions on Knowledge and Data Engineering
ER -
 
Haojun Wang, University of Southern California, Los Angeles
Roger Zimmermann, National University of Singapore, Singapore
With the proliferation of mobile devices, an increasing number of urban users subscribe to location-based services. This trend has led to significant research interest in techniques that address two fundamental requirements: road network-based distance computation and the capability to process moving objects as points of interests. However, there exist few techniques that support both requirements simultaneously. To address these challenges, we propose a novel approach to process continuous range queries. We build on our previous work of an infrastructure that supports location-based snapshot queries on MOVing objects in road Networks (MOVNet). We introduce several significant features to enable continuous queries. The dual index structure that we proposed for MOVNet has been appropriately modified. We further appoint a number of connecting vertices in each cell and precompute the distances among them to expedite query processing. Most importantly, to alleviate the effects of frequent object updates, we introduce a Shortest-Distance-based Tree (SD-Tree). We illustrate that the network connectivity and distance information can be preserved and reused by the SD-Tree when the query point location is updated; hence, reducing the continuous query update cost. Our experimental results demonstrate that our method yields excellent performance with 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] T. Brinkhoff, "A Framework for Generating Network-Based Moving Objects," GeoInformatica, vol. 6, no. 2, pp. 153-180, 2002.
[3] 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.
[4] 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.
[5] W. Feller, An Introduction to Probability Theory and Its Applications, vol. 1. Wiley, 1968.
[6] B. Gedik and L. Liu, "MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System," Proc. Int'l Conf. Extending Database Technology (EDBT), 2004.
[7] A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD, 1984.
[8] H. Hu, D.L. Lee, and J. Xu, "Fast Nearest Neighbor Search on Road Networks," Proc. Int'l Conf. Extending Database Technology (EDBT), 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. 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. 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. 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] M.F. Mokbel, X. Xiong, and W.G. Aref, "SINA: Scalable Incremental Processing of Continuous Queries in Spatio-Temporal Databases," Proc. ACM SIGMOD, 2004.
[17] K. Mouratidis, M. Hadjieleftheriou, and D. Papadias, "Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring," Proc. ACM SIGMOD, 2005.
[18] 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.
[19] 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.
[20] J.M. Patel, Y. Chen, and V.P. Chakka, "STRIPES: An Efficient Index for Predicted Trajectories," Proc. ACM SIGMOD, 2004.
[21] S. Saltenis, C.S. Jensen, S.T. Leutenegger, and M.A. Lopez, "Indexing the Positions of Continuously Moving Objects," Proc. ACM SIGMOD, 2000.
[22] H. Samet, J. Sankaranarayanan, and H. Alborzi, "Scalable Network Distance Browsing in Spatial Databases," Proc. ACM SIGMOD, 2008.
[23] D. Stojanovic, A.N. Papadopoulos, B. Predic, S. Djordjevic-Kajan, and A. Nanopoulos, "Continuous Range Monitoring of Mobile Objects in Road Networks," Data and Knowledge Eng., vol. 64, no. 1, pp. 77-100, 2008.
[24] J.A. Storer, An Introduction to Data Structures and Algorithms. Birkhauser Boston, 2001.
[25] 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.
[26] H. Wang and R. Zimmermann, "Snapshot Location-Based Query Processing on Moving Objects in Road Networks," Proc. ACM Int'l Symp. Advances in Geographic Information Systems (GIS), 2008.
[27] 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.
[28] X. Xiong, M.F. Mokbel, and W.G. Aref, "LUGrid: Update-Tolerant Grid-Based Indexing for Moving Objects," Proc. Int'l Conf. Mobile Data Management (MDM), 2006.
[29] 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 and GIS, location-dependent and sensitive.
Citation:
Haojun Wang, Roger Zimmermann, "Processing of Continuous Location-Based Range Queries on Moving Objects in Road Networks," IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 7, pp. 1065-1078, July 2011, doi:10.1109/TKDE.2010.171
Usage of this product signifies your acceptance of the Terms of Use.