基于R树及其变种的最近邻查询研究

Research on Nearest Neighbor Query Based on R-tree and Its Variants

最近邻查询是空间数据查询领域中最重要的查询技术之一。最近邻查询根据所查询的目标对象的运动特性分为静态最近邻查询和动态最近邻查询。静态最近邻查询的关键在于运用最小距离和最小最大距离作为查询条件,对索引树的节点进行排序和剪枝进而查找目标对象。通过对现有最近邻查询算法的分析研究,比较这些现有算法的优缺点。

The nearest neighbor query, is one of the most important query teehnoh）gy in the fieht of spatial Keywords data queries. Nearest neighbor queries is divided into statie nearest neighbor queries and dynamic nearest neighbor queries based on the motion characteristics of the target object. Static nearest neighbor query lies in the use of MINDIST and MINMAXDIST as a query, the index tree node staling and pruning and thus find the target object. Analyses the existing nearest neighbor query algorithm, compares the advantages and disadvantages of these algorithms.