A road network embedding technique for k-nearest neighbor search in moving object databases
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Semantic Caching in Location-Dependent Query Processing
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Maintenance of K-nn and spatial join queries on continuously moving points
ACM Transactions on Database Systems (TODS)
Nearest and reverse nearest neighbor queries for moving objects
The VLDB Journal — The International Journal on Very Large Data Bases
Distance indexing on road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Continuous range monitoring of mobile objects in road networks
Data & Knowledge Engineering
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
The V*-Diagram: a query-dependent approach to moving KNN queries
Proceedings of the VLDB Endowment
Continuous proximity monitoring in road networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Snapshot location-based query processing on moving objects in road networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Continuous Range Search Query Processing in Mobile Navigation
ICPADS '08 Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed Systems
RoadTrack: scaling location updates for mobile clients on road networks with query awareness
Proceedings of the VLDB Endowment
Ranking Spatial Data by Quality Preferences
IEEE Transactions on Knowledge and Data Engineering
Efficient location updates for continuous queries over moving objects
Journal of Computer Science and Technology
Processing of Continuous Location-Based Range Queries on Moving Objects in Road Networks
IEEE Transactions on Knowledge and Data Engineering
Continuous Monitoring of Distance-Based Range Queries
IEEE Transactions on Knowledge and Data Engineering
Dynamic range query in spatial network environments
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
A safe exit algorithm for continuous nearest neighbor monitoring in road networks
Mobile Information Systems
| Hi-index | 0.00 |
Query processing on road networks has been extensively studied in recent years. However, the processing of moving queries on road networks has received little attention. This paper studies the efficient processing of moving range queries on road networks. We formulate a network-based concept called safe exits that guarantee the query result of the client remains unchanged before the client reaches any exit. This significantly reduces the communication overhead between moving clients and the server. We then develop an efficient algorithm for computing safe exits for a client on-demand. We evaluate the proposed techniques using real road network data. Experimental results show that our algorithm constructs safe exits efficiently and they effectively reduce the communication cost.