ASYNCHRONOUS UPDATING ALGORITHM FOR CONTINUOUS MOVING OBJECTS QUERIES
Continuous queries for moving objects are becoming more and more important due to the increasing number of application domains that deal with moving entities. The asynchronous updating algorithm for continuous queries of moving objects is superior to synchronous updating algorithms in communication cost. By improving Haibo Hus rectangle safe region strategy we proposed a new continuous queries algorithm. Circle safe region and dynamic interval are adopted in our algorithm. Theory proof and experiment results show that our algorithm substantially outperforms the traditional periodic monitoring and the rectangle safe region algorithms in terms of monitoring accuracy, communication cost and CPU time. Furthermore, the mobile terminals need not have any computation ability in our algorithm.
Moving objects database continuous spatial query spatio-temporal reasoning
XIN-YING WANG SHENG-SHENG WANG ZHENG-XUAN WANG
College of computer science and technology, Key laboratory of symbolic computing and knowledge engineering of ministry of education, Jilin University, Changchun 130012,China
国际会议
2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)
大连
英文
1293-1297
2006-08-13（万方平台首次上网日期，不代表论文的发表时间）