移动对象的连续k最优有序路径查询  

THE CONTINUOUS K OPTIMAL SEQUENCED ROUTE QUERY FOR MOVING OBJECTS

作　　者：孙冬璞[1] 郝忠孝[1,2] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,黑龙江哈尔滨150080 [2]哈尔滨工业大学计算机科学与技术学院,黑龙江哈尔滨150001

出　　处：《计算机应用与软件》2011年第7期132-135,共4页Computer Applications and Software

基　　金：黑龙江省自然科学基金项目(F200601)

摘　　要：针对最优有序路径查询问题,提出了移动对象的连续k最优有序路径查询问题,并针对移动查询对象和静态数据对象的情况,通过引入加权相对距离函数的概念提出了SCkOSR算法和DCkOSR算法。SCkOSR算法利用加权相对距离函数确定数据点与移动查询对象的相对关系。DCkOSR算法进一步通过搜索区域的限制减少了计算加权相对距离函数的点的数量。实验表明,动态局部算法具有相对较好的性能。The concept of continuous k optimal sequenced route query for moving objects is put forward in consideration of the problem of optimal sequenced route query.The SCkOSR and DCkOSR algorithms are proposed by introducing the concept of additively weighted relative distance function aiming at such cases as with a moving query object and a static data object.The additively weighted relative distance functions between data points and moving-query are calculated by SCkOSR algorithm to determine their relative distances.Restricting search areas used in DCkOSR algorithm reduce the quantity of points included in the computation of additively weighted relative distance functions.Experimental results show better performance of the DCkOSR algorithm.

关 键 词：连续k最优有序路径查询 加权相对距离函数 移动对象 查询算法 

分 类 号：TP311.52[自动化与计算机技术—计算机软件与理论]