摘要： 为解决数据集中的单纯型连续近邻链查询问题，提出一种基于Voronoi图的查询方法。给出单纯型连续近邻链查询的定义，利用Voronoi图的性质对大量数据点进行精减，设计可准确查询出数据集中单纯型连续近邻链的查询算法。实验结果表明，随着待查连续近邻链所含数据点规模的增大，该方法的效率比传统基于R树方法更高。

关键词: 空间数据库, 数据集, 最近邻查询, 连续近邻链, R树, Voronoi图

Abstract: To handle the Simple Continues Near Neighbor Chain(SCNNC) query in dataset, the method based on the Voronoi diagram is proposed. The definition of SCNNC query is given and many data points are deleted based on the properties of the Voronoi diagram. The algorithm which can accurately query the simple continues near neighbor chain in dataset is put forward. Experimental results show that with the increasing numbers of the points in the simple continue near neighbor chain, the method has more advantages than the method based on R tree.

Key words: spatial database, dataset, Nearest Neighbor(NN) query, continues near neighbor chain, R tree, Voronoi diagram

中图分类号: 

• TP311.12