The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A Framework for Generating Network-Based Moving Objects
Geoinformatica
Range and kNN query processing for moving objects in grid model
Mobile Networks and Applications
Monitoring k-Nearest Neighbor Queries over Moving Objects
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
S-GRID: a versatile approach to efficient query processing in spatial networks
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
An efficient pre-computation technique for approximation KNN search in road networks
Proceedings of the 2009 International Workshop on Location Based Social Networks
Augmenting cartographic resources for autonomous driving
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Optimizing predictive queries on moving objects under road-network constraints
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
A safe-exit approach for efficient network-based moving range queries
Data & Knowledge Engineering
Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
Predictive line queries for traffic prediction
Transactions on Large-Scale Data- and Knowledge-Centered Systems VI
Hilbert-order based spatial cloaking algorithm in road network
Concurrency and Computation: Practice & Experience
G-tree: an efficient index for KNN search on road networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
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.