非结构化P2P网络的增量式查询

基于非结构化P2P网络的应用日益广泛,参与共享资源的节点越来越多,且呈海量增长趋势.如何在海量节点、海量资源的情况下,对同一查询语义进行增量式查询,是一个重要而颇具挑战性的问题.提出了一个通用的近似依相关性大小的非结构化P2P网络增量式查询算法模型,该算法模型使得针对同一查询语义的增量式查询尽力优先访问与语义最为相关的节点,从而在完全分布式的P2P网络中获得类似Google[1]的依据资源相关性排序显示及其"下一页"的功能.

Incremental Search for Unstructured P2P Network

Nowadays it is quite easy for common users to share and exchange resources on the Internet through application software based on peer-to-peer computing mode,and therefore more and more people join in peer-to-peer network to share and exchange resources. As a result, the number of peers becomes extremely large, and resources are extremely abundant and scattered. In this case, it is an important and challenging job to do incremental search to incrementally retrieve new related resources for any query. This paper presented a general incremental search model for unstructured P2P network. This general incremental search model makes incremental search try to access semantic most related nodes, and therefore it does similar searches as Google[1] in totally distributed P2P network.