移动对象的动态反向k最近邻研究  

Research of dynamic reverse k nearest neighbor search for moving objects

作　　者：董军[1] 杨秀娟[1] 

机构地区：[1]黑龙江科技学院计算机与信息工程学院,哈尔滨150027

出　　处：《计算机工程与应用》2009年第6期155-157,160,共4页Computer Engineering and Applications

摘　　要：反向最近邻查询是空间数据库中最重要的算法之一。传统的反向最近邻查询方法主要是针对静态对象的查询,随着无线通讯和定位技术的快速发展,移动对象发出的查询请求成为新的研究热点。该文将TPR-tree作为算法的索引结构,并提出了基于矩形框的对角线的修剪策略,将半平面修剪策略进行改进,给出了移动对象的动态反向k最近邻的查询方案。One of the most important algorithms in spatial database is reverse nearest neighbor query.Conventional query method focus on searching static objects mainly.With the rapid advancement in wireless communications and positioning techniques,algo- rithms for efficiently answering queries about large populations of moving objects are gaining interest.This paper proposes a dy- namic reverse nearest neighbor query algorithm for moving objeets.TPR-tree is used to indexing continuously moving objects.A trimming strategy which improved half-space trimming strategy is proposed according to the diagonal of rectangle.Furthermore,the dynamic reverse k nearest neighbor query for moving objects is presented.

关 键 词：空间数据库 最近邻查询 反向最近邻查询 TPR-树 

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