首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于PLC—iDistance的结构化P2P相似性检索算法
引用本文:王福海.基于PLC—iDistance的结构化P2P相似性检索算法[J].科技信息,2011(1):I0059-I0061.
作者姓名:王福海
作者单位:[1]上海交通大学信息安全工程学院,中国上海200000 [2]中国农业银行信用卡中心信息技术部,中国上海200000
摘    要:针对传统iDistance索引方法的缺陷和不足,提出了近似位置编码索引方法PLC—iDistance(ProximityLocationCode—iDistance),并在结构化P2P网络中实现了高维数据检索。在改进方法中,有效地缩小了需要搜索的范围,提高了检索性能;.实验表明,相比传统的iDistance索引方法.PLC—iDistance索引方法在时间性能上有较大的提高。

关 键 词:高维数据  高维索引  相似性检索

Similarity Search Algorithm on structure P2P networks Based on PLC-iDistance
Abstract:In view of the traditional iDistance indexing methods' flaw and insufficiency, the paper proposes an indexing method: PLC-iDistanee (Proximity Location Code-iDistanee). With the indexing structure mentioned above, we achieved a high-dimensional data retrieving system on a structure P2P networks. The improved method greatly narrows searching scope between high-dimensional data. So it greatly improves the performance of data searching. The experimental result indicates that, compared with the traditional iDistance indexing method, the improved method has a bigger enhancement in terms of time performance.
Keywords:High-dimensional data  High-dimensional index  Similarity search
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号