连续最近邻查询方法研究  

Research on Continuous Nearest Neighbor Search

作　　者：郭景峰[1] 王金慧[1] 侯爽[1] 孙浩[1] 

机构地区：[1]燕山大学信息科学与工程学院,秦皇岛066004

出　　处：《现代计算机》2004年第7期6-9,共4页Modern Computer

摘　　要：本文分析了目前进行连续最近邻查询的几种方法,并由该问题的几何特征入手,提出了基于R-tree的查询算法,可以避免分割点的丢失和高代价的查询,能够有效地完成移动对象的连续最近邻查询。Existing methods for continuous nearest neighbor search are introduced in this paper. From geometric problem characteristics, algorithms based on R-tree are proposed. The algorithms avoid the false misses and the high processing cost and can implement continuous nearest neighbor queries for moving objects efficiently.

关 键 词：连续最近邻查询 几何特征 R-TREE 查询算法 移动对象 二分查找 

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