Introduction to algorithms
A Framework for Generating Network-Based Moving Objects
Geoinformatica
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
SINA: scalable incremental processing of continuous queries in spatio-temporal databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Motion adaptive indexing for moving continual queries over moving objects
Proceedings of the thirteenth ACM international conference on Information and knowledge management
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
A generic framework for monitoring continuous spatial queries over moving objects
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries
IEEE Transactions on Mobile Computing
Continuous nearest neighbor monitoring in road networks
VLDB '06 Proceedings of the 32nd 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
Continuous range monitoring of mobile objects in road networks
Data & Knowledge Engineering
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
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
PAM: An Efficient and Privacy-Aware Monitoring Framework for Continuously Moving Objects
IEEE Transactions on Knowledge and Data Engineering
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks
MDM '10 Proceedings of the 2010 Eleventh International Conference on Mobile Data Management
IEEE Transactions on Mobile Computing
RoadTrack: scaling location updates for mobile clients on road networks with query awareness
Proceedings of the VLDB Endowment
Constrained range search query processing on road networks
Concurrency and Computation: Practice & Experience
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
Continuous expansion: efficient processing of continuous range monitoring in mobile environments
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
A safe-exit approach for efficient network-based moving range queries
Data & Knowledge Engineering
Dynamic range query in spatial network environments
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Distributed continuous range query processing on moving objects
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Continuous range k-nearest neighbor queries in vehicular ad hoc networks
Journal of Systems and Software
Hi-index | 0.00 |
In this paper, we investigate the problem of computing the safe exit points of moving range queries in directed road networks where each road segment has a particular orientation. The safe exit point of query object q indicates the point at which the safe region and non-safe region of q meet. A safe region indicates a region where the query result remains unchanged provided q remains inside this region. Unfortunately, the existing state-of-the-art algorithm focuses on computing the safe exit points of moving range queries in undirected road networks where every road segment is undirected. What is worse, far too little attention has been paid to moving range queries in dynamic road networks where the network distance changes depending on the traffic conditions. In this paper, we address these problems by proposing an efficient algorithm called CRUISE for computing the safe exit points of moving range queries in directed road networks. Our experimental results demonstrate that CRUISE significantly outperforms a conventional solution in terms of both computational and communication costs.