一种移动对象增量组最近邻居查询方法  

Incremental Group Nearest Neighbor Query Method in Moving Objects

作　　者：徐丽萍[1] 徐清平[1] 潘鹏[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,武汉430074

出　　处：《计算机工程》2008年第2期81-85,共5页Computer Engineering

基　　金：湖北省自然科学基金资助项目(ABA048)

摘　　要：基于移动对象增量最近邻居查询(INCNN),提出一种移动对象增量组最近邻居查询方法(INCGNN)。该方法以较小的代价求出每次更新时刻的组最近邻居。针对组最近邻居查询的特点,给出了k+1组最近邻居查询改进算法,椭圆剪枝和延迟更新3种优化查询的策略。实验结果表明,INCGNN明显优于REEGNN,3种优化策略能较好地提高查询性能。This paper proposes an Incremcntal Group Nearest Neighbor query （INCGNN） method in moving objects which is based on the Incremental Nearest Neighbor query method （INCNN）, The method obtains the query result at a less cost. As the group nearest neighbor query has its own feature, three query optimization methods are offered, which include the improved k＋1 group nearest neighbor query algorithm, the ellipse-based pruning method and the delayed update method. Experimental results show that INCGNN outperforms REEGNN significantly and the above optimization methods could enhance the query performance efficiently.

关 键 词：移动对象 组最近邻居查询 最近邻居查询 

分 类 号：TP392[自动化与计算机技术—计算机应用技术]