基于聚类金字塔的Chord超矩形范围查询  

Range Query for Hypercube on Chord Based on Clustering-pyramid

作　　者：孟宪福[1] 张振强[1] 

机构地区：[1]大连理工大学计算机科学与工程系,大连116024

出　　处：《计算机工程》2010年第14期62-64,共3页Computer Engineering

摘　　要：针对超球体查询方式不能将查询范围细化到每一维上的问题,提出一种基于聚类金字塔的超矩形范围查询方法。采用聚类金字塔技术对高维数据建立一维索引值,利用位置保持哈希函数为每个索引值赋予一个唯一的标识,从而构建P-Chord系统,在此基础上,给出范围查询过程。实验结果验证了P-Chord系统在减少距离计算代价与误中点个数、提高查全率等方面的有效性。Conventional super-sphere retrieval method can not set the retrieval scope into every dimension.Aiming at this problem,a retrieval method based on hypercube area is proposed.High-dimensional data are converted into 1-dimensional index values using clustering-pyramid technique and every index value is identified with an unique mark using locality-preserving Hash function.The P-Chord system is generated.A range query process is given on that basis.Experimental results show that the proposed approach has advantages over reducing the cost of computing distance and the sets of false hits,and improving recall ratio.

关 键 词：范围查询 CHORD网络 聚类金字塔 位置保持哈希函数 

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