TY - GEN
T1 - Continuous range monitoring of moving objects in road networks
AU - Zhu, Tongyu
AU - Wang, Chen
AU - Lv, Weifeng
AU - Huang, Jian
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
KW - Classification
KW - Continuous range queries
KW - Location based services
KW - Moving objects
KW - Spatial road network
UR - https://www.scopus.com/pages/publications/79851489629
U2 - 10.1109/ISDA.2010.5687108
DO - 10.1109/ISDA.2010.5687108
M3 - 会议稿件
AN - SCOPUS:79851489629
SN - 9781424481354
T3 - Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10
SP - 1412
EP - 1417
BT - Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10
T2 - 2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10
Y2 - 29 November 2010 through 1 December 2010
ER -