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

P2P网络中相似文本的聚集存储和模糊查询
引用本文:董建设,袁占亭,张秋余.P2P网络中相似文本的聚集存储和模糊查询[J].吉林大学学报(工学版),2007,37(6):1349-1353.
作者姓名:董建设  袁占亭  张秋余
作者单位:兰州理工大学,计算机与通信学院,兰州,730050
基金项目:国家高技术研究发展计划(863计划)
摘    要:针对目前各种结构化P2P协议在对资源进行查询时依赖于准确的全局唯一标识符(Global Unique Identifier),无法实现相似资源的模糊查找的问题,提出了一种资源发布和查找策略,实现了相似文本的聚集存储和模糊查询。该策略首先根据文本内容生成具有强鲁棒性的指纹,以该指纹作为文本在P2P网络中发布的基础,实现将相似的文本发布到同一节点或相邻节点,进而实现高效的分布式相似文本查询。该算法构建在分布式哈希表(DHT)路由基础之上,适用于各种以DHT为特征的结构化P2P系统。

关 键 词:计算机系统结构  相似文本查询  聚集存储  P2P网络
文章编号:1671-5497(2007)06-1349-05
收稿时间:2006-08-25
修稿时间:2006年8月25日

Aggregating store and approximate text addressing in P2P networks
Dong Jian-she,Yuan Zhan-ting,Zhang Qiu-yu.Aggregating store and approximate text addressing in P2P networks[J].Journal of Jilin University:Eng and Technol Ed,2007,37(6):1349-1353.
Authors:Dong Jian-she  Yuan Zhan-ting  Zhang Qiu-yu
Affiliation:School of Computer and Communication, Lanzhou University of Technology, Lanzhou 730050, China
Abstract:To launch a search for a given resource in different existing structured Peer-to-Peer(P2P) networks,the global unique identifier of the resource must be known in advance.Hence it is difficult to implement a search for approximate documents.To solve this problem,a novel routing scheme was proposed for resource publishing and addressing in structured P2P systems.By this scheme,according to the content of the texts a robust fingerprint is generated,which is taken as the base of text publication in P2P network.The key-value pairs of approximate tests are published to a unique node or contiguous peers,thus the distributed approximate texts can be efficiently searched by range queries.The system is constructed based on the Chord overlays,it is also applicable on other structured P2P systems.
Keywords:computer systems organization  approximate text addressing  aggregating storing  P2P network
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《吉林大学学报(工学版)》浏览原始摘要信息
点击此处可从《吉林大学学报(工学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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