移动对象的K个连续最近邻查询算法  

Algorithems K Continuous Nearest Neighbor Queries for Moving Objects

作　　者：黄敬良[1] 郝忠孝[1] 

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

出　　处：《哈尔滨理工大学学报》2007年第6期24-27,共4页Journal of Harbin University of Science and Technology

摘　　要：给定一个移动查询点和一个移动对象集合,由于查询和数据对象的位置都是连续变化的,因此不能依赖于给出的固定参考位置来解决查询问题.为了解决移动对象的K个连续最近邻查询,在TPR树的基础上,提出了分界时间的概念,利用α剪枝技术给出了查询算法.利用模拟试验证明了该算法的时间复杂度比其他算法有较大改善.Given a moving query and a set of moving objects, both the query and the data objects change positions continuously,and therefore we can not rely on a given fixed reference position to determine the answer. In order to process K nearest neighbor queries in moving object database ,this paper prompts the concept of split time and develops an efficient algorithem that base on the index of TPR-tree and use α prunig technique to resolve the problem. An simulative experiment shows that significant improvements are achieved compared to the existing algorithems.

关 键 词：移动对象 TPR树 α剪枝技术 连续最近邻查询 

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