A Framework for Generating Network-Based Moving Objects
Geoinformatica
IEEE Transactions on Computers
Dynamic Queries over Mobile Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Main Memory Evaluation of Monitoring Queries Over Moving Objects
Distributed and Parallel Databases
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
Indexing the Trajectories of Moving Objects in Networks*
Geoinformatica
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
A generic framework for monitoring continuous spatial queries over moving objects
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
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
Introducing mobility concepts into geographic information systems
ACS'08 Proceedings of the 8th conference on Applied computer scince
Optimizations of raster map visualization in mobile GIS
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Hi-index | 0.00 |
In this paper we address the problem and propose the method for continuous range query processing for mobile objects moving on known network paths. The method assumes that the objects know their destination in advance and move along the best/shortest path to it. The method is based on an available 2D indexing scheme (e.g. R* Tree) for indexing transportation network data. The network R* tree is extended to provide matching of queries and objects according to their locations on the network for stationary objects/queries or their network routes for mobile objects/queries and performing the filter step of the continuous query. The refinement step of the query processing methodology generates main memory data structures that represent temporal query result and support periodic, incremental evaluation to produce result updates.