ABSTRACT
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.
- N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In SIGMOD Conference, 1990. Google ScholarDigital Library
- T. Brinkhoff. A framework for generating network-based moving objects. GeoInformatica, 6(2):153--180, 2002. Google ScholarDigital Library
- H. D. Chon, D. Agrawal, and A. E. Abbadi. Range and kNN query processing for moving objects in grid model. MONET, 8(4), 2003. Google ScholarDigital Library
- X. Huang, C. S. Jensen, H. Lu, and S. Saltenis. S-GRID: A Versatile Approach to Efficient Query Processing in Spatial Networks. In SSTD, 2007. Google ScholarDigital Library
- K. Mouratidis, M. Hadjieleftheriou, and D. Papadias. Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In SIGMOD Conference, 2005. Google ScholarDigital Library
- K. Mouratidis, M. L. Yiu, D. Papadias, and N. Mamoulis. Continuous nearest neighbor monitoring in road networks. In VLDB, 2006. Google ScholarDigital Library
- D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query processing in spatial network databases. In VLDB, 2003. Google ScholarDigital Library
- Y. Tao, D. Papadias, and J. Sun. The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. In VLDB, 2003. Google ScholarDigital Library
- H. Wang and R. Zimmermann. Framework for Snapshot Location-based Query Processing on Moving Objects in Road Networks. Technical Report 08-899, University of Southern California, 2008.Google Scholar
- X. Xiong, M. F. Mokbel, and W. G. Aref. SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases. In ICDE, 2005. Google ScholarDigital Library
- X. Yu, K. Q. Pu, and N. Koudas. Monitoring k-nearest neighbor queries over moving objects. In ICDE, 2005. Google ScholarDigital Library
Index Terms
- Snapshot location-based query processing on moving objects in road networks
Recommendations
Exploiting location-aware social networks for efficient spatial query processing
In this paper, we introduce two watchtower-based parameter-tunable frameworks for efficient spatial processing with sparse distributions of Points of Interest (POIs) by exploiting mobile users' check-in data collected from the location-aware social ...
An approach to process continuous location-dependent queries on moving objects with support for location granules
Location-based services have attracted the attention of important research in the field of mobile computing. Specifically, different mechanisms have been proposed to process location-dependent queries. In the above mentioned context, it is usually ...
Location-dependent query processing: Where we are and where we are heading
The continuous development of wireless networks and mobile devices has motivated an intense research in mobile data services. Some of these services provide the user with context-aware information. Specifically, location-based services and location-...
Comments