Abstract:
A set of distributed continual range query requests, each defining a geographical region of interest, needs to be periodically reevaluated to provide up to date answers. Processing these continual queries efficiently and incrementally becomes important for location based services and applications. In this paper, we propose an efficient incremental method for continuous range query characterized by mobility of objects which follow paths in an underlying spatial road network. We notice that both queries and moving objects can be attached to the road link for updating of query answers. By using Grid R*-tree which indexing spatial road network data, query requests and moving objects register themselves to corresponding road links according to query areas and moving object locations on the network. Also we analyzed the impacts to query answers caused by geometry relation of road link and query area and state of moving objects. Then we proposed an efficient update algorithm and corresponding memory data structures based on spatial and state classification which formed a safe region to avoid unnecessary updates. Finally a comprehensive experimental evaluation using real data has been conducted to demonstrate the efficiency and effectiveness of our algorithm.