LDCQ的距离更新策略  

The strategy for distance-based update in LDCQ

作　　者：董毅[1] Edward Chan 黄载禄[1] 

机构地区：[1]华中科技大学电子与信息工程系 [2]香港城市大学计算机科学系

出　　处：《华中科技大学学报（自然科学版）》2003年第12期35-37,共3页Journal of Huazhong University of Science and Technology(Natural Science Edition)

摘　　要：提出了在LDCQ中保证满足误差限制的距离更新策略 .移动对象和查询边界的距离远近不同 ,它们相交的可能性也不同 ,因而对查询结果的影响也不一样 .依据它们之间距离的不同 ,给予移动对象不同的偏差限 :使得越靠近查询边界 ,移动对象的偏差限越小 ;反之亦然 .其好处是减少了大量的不必要的更新 ,减轻了系统负荷 .This paper presented distance-based update strategy for LDCQ to guarantee error limitation. The possibilities of intersecting varied with the different distances between moving objects and querying boundary . Moving objects had different influences on the query result. The different deviation limit was given to different moving objects according to their distances. Those moving objects close to the query boundary had smaller deviation limits, and vice versa. The advantages were a great number of unnecessary updates reduced and the payload of the system relieved.

关 键 词：LDCQ 位置相关连续查询 误差限制 距离更新策略 偏差限 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]