Processing of continuous location-based range queries on moving objects in road networks

IEEE Transactions on Knowledge and Data Engineering

Volumn 23, Issue 7, 2011, Pages 1065-1078

  Wang, Haojun ^a   Zimmermann, Roger ^b  

^a University of Southern California ^*  (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

location dependent and sensitive; Spatial databases and GIS

Indexed keywords

CONTINUOUS QUERIES; DISTANCE COMPUTATION; DISTANCE INFORMATION; EXCELLENT PERFORMANCE; INDEX STRUCTURE; LOCATION BASED; LOCATION-BASED SERVICES; LOCATION-DEPENDENT AND SENSITIVE; MOVING OBJECTS; NETWORK CONNECTIVITY; NETWORK-BASED; POINTS OF INTEREST; PRECOMPUTE; QUERY POINTS; RANGE QUERY; ROAD NETWORK; SNAPSHOT QUERIES; SPATIAL DATABASES AND GIS;

MOBILE DEVICES; PLANT EXTRACTS; QUERY PROCESSING; ROADS AND STREETS; TREES (MATHEMATICS);

MOTOR TRANSPORTATION;

EID: 80054886924     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2010.171     Document Type: Article

References (29)

1. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*-Tree: An Efficient and Robust Access Method for Points andRectangles," Proc. ACM SIGMOD, 1990.
2. T. Brinkhoff, "A Framework for Generating Network-BasedMoving Objects," GeoInformatica, vol. 6, no. 2, pp. 153-180, 2002.
3. H.-J. Cho and C.-W. Chung, "An Efficient and Scalable Approachto CNN Queries in a Road Network," Proc. Int'l Conf. Very LargeData Bases (VLDB), 2005.
4. H.D. Chon, D. Agrawal, and A.E. Abbadi, "Range and kNNQuery Processing for Moving Objects in Grid Model," MobileNetworks 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 ofContinuously Moving Queries on Moving Objects in a MobileSystem," Proc. Int'l Conf. Extending Database Technology (EDBT),2004.
7. A. Guttman, "R-Trees: A Dynamic Index Structure for SpatialSearching," Proc. ACM SIGMOD, 1984.
8. H. Hu, D.L. Lee, and J. Xu, "Fast Nearest Neighbor Search onRoad Networks," Proc. Int'l Conf. Extending Database Technology(EDBT), 2006.
9. H. Hu, J. Xu, and D.L. Lee, "A Generic Framework for MonitoringContinuous Spatial Queries over Moving Objects," Proc. ACMSIGMOD, 2005.
10. X. Huang, C.S. Jensen, H. Lu, and S. Saltenis, "S-GRID: A VersatileApproach 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 toNearest 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, "NearestNeighbor Queries in Road Networks," Proc. ACM Int'l Symp.Advances in Geographic Information Systems (GIS), 2003.
13. +-Tree Based Indexing of Moving Objects," Proc. Int'l Conf. VeryLarge Data Bases (VLDB), 2004.
14. M.R. Kolahdouzan and C. Shahabi, "Continuous K-NearestNeighbor Queries in Spatial Network Databases," Proc. WorkshopSpatio-Temporal Database Management (STDBM), 2004.
15. M.R. Kolahdouzan and C. Shahabi, "Voronoi-Based K-NearestNeighbor 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: ScalableIncremental Processing of Continuous Queries in Spatio-TemporalDatabases," Proc. ACM SIGMOD, 2004.
17. K. Mouratidis, M. Hadjieleftheriou, and D. Papadias, " ConceptualPartitioning: An Efficient Method for Continuous NearestNeighbor 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, "QueryProcessing in Spatial Network Databases," Proc. Int'l Conf. VeryLarge Data Bases (VLDB), 2003.
20. J.M. Patel, Y. Chen, and V.P. Chakka, "STRIPES: An EfficientIndex 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 NetworkDistance Browsing in Spatial Databases," Proc. ACMSIGMOD, 2008.
23. D. Stojanovic, A.N. Papadopoulos, B. Predic, S. Djordjevic-Kajan,and A. Nanopoulos, "Continuous Range Monitoring of MobileObjects in Road Networks," Data and Knowledge Eng., vol. 64, no. 1,pp. 77-100, 2008. (Pubitemid 350089972)
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 OptimizedSpatio-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 QueryProcessing on Moving Objects in Road Networks," Proc. ACM Int'lSymp. Advances in Geographic Information Systems (GIS), 2008.
27. X. Xiong, M.F. Mokbel, and W.G. Aref, "SEA-CNN: ScalableProcessing 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-TolerantGrid- Based Indexing for Moving Objects," Proc. Int'l Conf. MobileData Management (MDM), 2006.
29. X. Yu, K.Q. Pu, and N. Koudas, "Monitoring K-Nearest NeighborQueries over Moving Objects," Proc. Int'l Conf. Data Eng. (ICDE)2005.