A New K-neighbor Search Algorithm Based on Variable Incremental Dynamic Grid Division

摘要：

K-neighbor search algorithm b an important doss of query type in the spatial database, a new Kneighbor search algorithm based on variable incremental dynamic grid division is proposed in Ms paper, which is under the analysis of the traditional K-neighbor search algorithm based on dynamic grid division, this algorithm will carry on clustering to the dam objects around the queried dan object, use the side length of the smallest bounding rectangle which is formed due to the cluster to carry on incremental expansion and form the dynamic grid, the grid achieved can reasonably divide the data objects, make full use of the storage space and reflect the position relationship between the dam objects, so it can avoid a waste of storage space because of equidistant division in the opposite direction of each dimension in the past and overcome the shortcoming of not effectively searching because it can not divide the adjacent data objects together, it can achieve the fast K- neighbor queries, the experiments show that this search algorithm can reduce the node access times and the CPU running time, so it has an excellent performance.

关键词： K-neighbor search algorithm variable incremental dynamic grid clustering

作者: Guobin Li JineTang

作者单位: School of Computer Science and Technology Henan Polytechnic University Jiaozuo, China

会议类型: 国际会议

会议名称: 2010 International Symposium on Computational Intelligence and Edsign(第三届计算智能与设计国际学术研讨会 ISCID 2010)

会议地点: 杭州

会议语种:英文

页码: 167-170

在线出版日期: 2010-10-29（万方平台首次上网日期，不代表论文的发表时间）