移动对象历史轨迹的连续最近邻查询算法  

Continuous Nearest Neighbor Query Algorithm for Historical Trajectories of Moving Objects

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

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

出　　处：《计算机工程》2009年第1期52-54,共3页Computer Engineering

摘　　要：提出一种直接在原始时空坐标系下对一维移动对象的历史轨迹进行连续最近邻查询的算法,给出相关的定义与定理,通过分析轨迹之间的交点及轨迹线段单调性等特征,利用以前所求得的最近邻结果信息进行连续最近邻的查询判断。实验结果与分析表明,该算法具有较好的性能。Continuous nearest neighbor query is one of the key problems in spatio-temporal databases. A method for direct query of continuous nearest neighbors is proposed for historical trajectories of moving objects, and the related definition and theorems are introduced. By analyzing the characteristics such as the intersections of trajectories and the monotonicity of trajectory segments, and using the results of previous computation at the same time, the continuous nearest neighbor query processing is developed. Experimental results and analysis show that the algorithm has better performance.

关 键 词：连续最近邻查询 时空数据库 移动对象 轨迹 单调性 

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