Incremental evaluation of continuous range queries over objects moving on known network paths

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.