摘要
为了改进无结构对等网络中搜索效率低下的问题,提出了一种基于兴趣域的高效搜索方案.和常用的随机搜索方案不同,在所提方案中,文档属性由元数据通过RDF语句描述,拥有相同元数据的节点同属一个兴趣域,搜索请求首先在兴趣域中传播,大大提高了搜索效率.随着搜索过程的进行,节点对兴趣域内其他节点了解越多其搜索效率也越高.通过元数据选择窗口和元数据复制机制,可以进一步提高搜索效率.模拟实验结果证实了所提方案在无结构对等网络中的准确和高效.
A novel search scheme is proposed to address the efficiency and scalability issues in unstructured peer-to-peer networks Unlike the notorious search scheme of flooding in unstructured peer-to-peer networks, the proposed scheme is based on the domain of interest that is formed by nodes sharing the same interest Search request is propagated within the domain of interest, and the efficiency of search process is very high after nodes in the same domain of interest get familiar with one another In the proposed scheme, attributes of document are described by metadata using RDF statements to support flexible queries; nodes having the same metadata belong to the same domain of interest With the facility of metadata selection window and metadata replication, performance of the proposed search scheme is further improved Simulation results prove the effectiveness and efficiency of the proposed scheme
出处
《计算机研究与发展》
EI
CSCD
北大核心
2005年第5期804-809,共6页
Journal of Computer Research and Development
基金
国家自然科学基金项目(60373018)
关键词
对等网络
兴趣域
元数据
搜索
peer-to-peer network
domain of interest
metadata
search
