路网中速度不确定移动对象的K范围近邻查询方法  

A method of range nearest neighbor query of moving objects with uncertain velocity in road network

作　　者：邓成玉[1,2] 胡云[1] 周同[1] 王宝文[1,2] 索健 

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004 [2]河北省计算机虚拟技术与系统集成重点实验室,河北秦皇岛066004 [3]抚宁县国家税务局,河北抚宁066300

出　　处：《燕山大学学报》2012年第6期526-533,共8页Journal of Yanshan University

摘　　要：K范围近邻查询是指查找给定范围区域内所有点的近邻对象。现有工作主要考虑对象固定不动情况下的K范围近邻查询,实际上对象不但可能移动,而且由于外界环境和自身情况等不确定性因素的影响,移动对象运动速度的不确定性也是客观存在的。基于此,本文考虑了速度不确定移动对象的K范围近邻查询,提出路网中速度不确定的移动对象的K范围近邻查询的处理算法,利用共享查询的思想减少了冗余查询的代价,最后,通过实验验证了所提算法的有效性。The k Range Nearest Neighbor （kRNN） query is to find the k nearest neighbor of any point in a given query region. The kRNN query of fixed objects is considered now.In fact, objects are possible to move,also because of uncertain factors of environments and query object itself, the velocity uncertainty of moving object exists. Based on this, the kRNN query of moving objects with uncertain velocity is considered. The algorithm to process the k Range Nearest Neighbor （kRNN） query of moving objects with uncertain velocity in road network is proposed. With the advantage of sharing query, the cost to query is reduced. Finally, the ex- perimental results show the the proposed algorithm is effective.

关 键 词：空间数据库 路网 不确定性 K近邻查询 k范围近邻查询 

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