数据集中单纯型连续近邻链查询方法  

Query Method of Simple Continus Near Neighbor Chain in Dataset

作　　者：李松[1] 张丽平[1] 蔡志涛[2] 郝晓红[3] 王淼[1] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,哈尔滨150080 [2]盐城生物工程高等职业技术学校汽车电子工程系,江苏盐城224051 [3]哈尔滨理工大学计算中心,哈尔滨150080

出　　处：《计算机工程》2012年第4期82-83,87,共3页Computer Engineering

基　　金：黑龙江省教育厅科学技术研究基金资助项目(11551084)

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

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

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