超节点对等网络信息检索关键技术研究
|
摘要
对等网络（Peer-to-Peer，简称P2P）具有数据分布式存储、节点平等、节点间直接通信等特点，被广泛应用到信息检索、文件共享等领域。随着网络规模越来越大，网络极易产生瓶颈现象和节点失效的问题。为了解决这些问题，人们尝试对超节点对等网络信息检索技术展开研究。但相关研究成果还存在一些不足，仍有许多关键问题亟待解决。例如：如何按照语义相近的原则构建超节点对等网络，以进一步提高搜索效率和检索结果质量；如何设计节点常数度数的超节点拓扑结构，以进一步降低网络维护代价；如何设计失效节点、链路故障的发现和恢复机制，以提高网络的容错性；如何建立分布式查询机制，以减少超节点的负载、提高检索结果质量和下载质量等。这些关键问题的解决，将有利于满足用户对信息检索的需求，为用户提供更加便捷的信息检索平台。因此，对超节点对等网络的信息检索展开研究，有着重要的理论研究意义和实际应用价值。
本文以提高搜索效率、检索结果质量和下载质量，降低网络维护代价，增强网络容错性为目标，围绕上述关键问题展开研究。在此基础上利用所得的研究成果设计和实现了一个原型系统。本文主要研究内容及贡献包括以下几个方面：
（1）在超节点对等网络的构建方面，本文针对早期的超节点对等网络信息检索中，存在普通节点与超节点连接缺乏语义相关性，搜索效率和检索质量不高，缺乏超节点负载平衡等问题，提出了一种基于在线聚类的超节点对等网络构建方法。主要工作包括：①改进了已有在线聚类算法，以适应高动态的对等网络。该算法保证了普通节点按照语义相关性连接超节点，较好地解决了资源准确定位的问题。②提出了一种超节点选择和动态调整超节点选择策略。该策略能根据超节点自身的负载能力，动态调整连接普通节点的数量，使超节点的选择更加简单，减少了超节点因负载过重而出现网络瓶颈的可能性。③提出一种搜索路由优化机制，使检索尽可能在某个语义组内完成，减少了查询请求转发次数，进一步减少了查询带宽消耗、提高了搜索效率和检索结果。
（2）在节点共享文档组织方面，为了克服已有共享文档组织方法不利于构建语义覆盖网络的问题，提出一种基于层次聚类树的超节点对等网络。主要工作包括：①改进了传统层次聚类算法，以适应多文档集聚类。采用该算法将节点共享文档集聚类，根据簇之间的语义范畴形成层次聚类树，克服了传统单层次聚类很难揭示文档之间语义关系的不足。②在层次聚类树的构建过程中，利用曲线多项式拟合技术，设计一种自动发现并设置阈值的方法。这种方法使聚类过程更加智能化和自动化，聚类结果更加准确。③提出了基于层次聚类树的超节点对等网络构建方法。利用该方法，普通结点能根据网络中已有语义组的语义范畴，选择不同层次的簇与超节点建立连接，提高了搜索效率、减少了查询带宽消耗。
（3）在超节点拓扑结构方面，针对已有超节点对等网络中超节点拓扑结构复杂、无序，难维护、不便于搜索路由等问题，提出了两类常数度数的超节点拓扑结构模型。主要工作包括：①在分析完美差异图（PDG）结构的基础上，提出一种新的k-PDG拓扑结构，并利用该结构组织超节点，建立了一种新的超节点对等网络。②提出一种新的k-皮特森图拓扑结构。采用改进的皮特森图，将网络中超节点按照k-皮特森图拓扑结构进行组织，建立了一种新的超节点对等网络。性能分析和模拟结果表明：这两类结构与现有超节点拓扑结构相比，除具有支持多关键词查询、减少搜索所产生的查询消息量外，在动态适应性方面，新超节点对等网络能更好地降低超节点失效对拓扑产生的影响；在性能上，该网络具有更小的拓扑构造和失效修复成本。
（4）在分布式查询方面，针对现有超节点对等网络中超节点负担重，查询结果缺乏统一排序、包含重复结果的下载节点可能无效等问题，提出一种低负载和高质量的分布式查询处理机制。主要工作包括：①提出一种分布式查询处理机制，减少了超节点的查询负载。②提出一种基于近似全局信息的分布式排序方法，实现对查询结果进行统一排序。③提出一种下载节点选择机制，提高了下载请求的成功率、减少响应时间和网络通信消耗。
（5）原型系统的设计和实现。将本文研究成果，如节点共享文档组织方法、超节点构建算法、超节点拓扑结构、分布式查询处理等关键技术加入到系统中，设计与实现了一个原型系统。
The peer-to-peer (P2P) networks have been playing an important role in thefields of information retrieving and file sharing in view of the characteristics of thedistributed data storage, the equivalence of nodes and the direct communicationbetween nodes, and so on. Along with the growing network scale is larger and larger,the network bottleneck and node failure problems are more likely to arise. Becausethe super node network has potential advantage such as high search efficiency, rapidpositioning, fault-tolerant, scalable and so on, In order to solve the problems, peoplebased on the Super-Peer networks information retrieval start to make a preliminarystudy. However existing researches results have still some shortcomings, there arestill many key problems need to be solved. Such as, how to construct a Super-Peernetwork according to the semantic similarity principle to further improve the searchefficiency and the quality of search; how to design super-peers topology structurewith constant degree to further reduce network maintenance cost; how to designfailure node, link failure detection and recovery mechanism to improve the networkfault tolerance; how to establish mechanism of distributed query to reduce the supernodes load, improve the quality of retrieval results and results downloading. Solvingthese key problems will be helpful for users to meet the needs of information retrieval,to provide users with more convenient and efficient information retrieval platform.Therefore, there are important theory values and the practical significances toresearch network information retrieval in Super-Peer networks.
This paper aims at improving the searching efficiency, the quality of search anddownload quality, reducing network maintenance cost, enhancing network faulttolerance as well, which research the key problems, utilize the study results designand implementation of prototype system. The aspects of main research contents andcontributions include as following:
(1) In the aspects of the Super-Peer networks construction, earlier Super-Peernetworks have some defects, such as the connections between super-peers andclient-peers lack of semantic relevance, the search efficiency and the quality ofretrieval results are not high, and it does not deal with the super-peer load balance. Anovel method of constructing super-peers networks based on online cluster isproposed. The main research contents include: Firstly, an improved online cluster algorithm is proposed to be applied to high dynamically peer-to-peer networks. Thisalgorithm ensures every super-peer having strong semantic relativity with theclient-peers joined, thus provides a good solution to the problem of accurate locatingresources. Secondly, the method adopts an adaptive dynamically adjustment strategyfor choosing super-peers when client peers connect the super-peer. With the strategy,super-peers can dynamically adjust the number of client peers according to itsoverlaod capacity. It makes simply for selecting super-peer, and solves networkbottle-neck problem caused by overloading super-peer with the networks sizeenlarging. Thirdly, the theme also raises an optimized searching mechanism toimprove search efficiency and retrieval result.
(2) In the aspects of organization and management of shared documents, currentmethods of organizing shared documents are not effective to construct semanticoverlay networks. In order to overcome the drawbacks, this theme proposes atechnique called Super-Peer Network based on Hierarchical Cluster Trees. The mainresearch contents include: Firstly, a new algorithm is proposed to arrange sharedocuments in peers into hierarchical cluster tree structures according to clustersemantic features. This tree structure is logical in term of arranging clusters, and therelationship between clusters is more clearly reflected compared to the one-level, flatstructure. Secondly, for a hierarchical cluster tree, a method is proposed based onmultinomial simulation technique. By this method, clusters can be dynamicallygenerated or merged according the semantic feature of related clusters and documents,rather than having a fixed threshold which was used in earlier methods. Thirdly, aconstruction method for Super-Peer network based on Hierarchical Cluster Trees hasbeen developed, so that different level clusters at client peers can establish links tothe clusters trees of super peers of semantic overlay networks according to cluster anddocument feature similarities, to improve the search efficiency and decrease networkbandwidth cost.
(3) In the aspects of super-peers topology structures, existing networks topologystructures have some defects, such as complex maintenance and consuming anexcessive amount of bandwidth. Two constant degree super-peers topology structuresare proposed. The main research contents include: Firstly, a new Super-Peer networkis proposed by analyzing the characters of perfect difference graph (PDG), a novelk-PDG structure and the corresponding super-peer overlay topology construction andmaintenance approaches are proposed. Secondly, a novel k-Petersen graph is proposedby analyzing the characteristics and the deficiencies of Petersen graph, a new Super-Peer network based on k-Petersen graph. Compared with existed super-peertopologies, the new super-peers toplogies scheme support approximate query, andreduce the bandwidth consumption during search and decrease the cost of topologyconstruction and maintenance.
(4) In the aspects of distributed query, for existed super-peers networks havesome faults such as retrieval result global ranked, duplicated and invalid downloadpeers, a mechanism of low overload and high quality distributed is proposed. Themain research contents include: Firstly, a method of building data index and selectingquery-peer in a super-peer is presented to decrease super-peer burden. Secondly, adistributed ranking approach based on global information is addressed, to solveretrieval results rank. Thirdly, a strategy of selecting downloading peers forduplicated results to reduce retrieval overlap, network transfers cost and responsetime.
(5) A prototype system of information retrieval in Super-Peers network isdesigned and implemented. Researches presented in this paper are realized in theprototype system, such as the method of organizing shared documents, the algorithmto construct super-peer networks, the mechanism of searching and sorting retrievalresults, and so on.
本文以提高搜索效率、检索结果质量和下载质量，降低网络维护代价，增强网络容错性为目标，围绕上述关键问题展开研究。在此基础上利用所得的研究成果设计和实现了一个原型系统。本文主要研究内容及贡献包括以下几个方面：
（1）在超节点对等网络的构建方面，本文针对早期的超节点对等网络信息检索中，存在普通节点与超节点连接缺乏语义相关性，搜索效率和检索质量不高，缺乏超节点负载平衡等问题，提出了一种基于在线聚类的超节点对等网络构建方法。主要工作包括：①改进了已有在线聚类算法，以适应高动态的对等网络。该算法保证了普通节点按照语义相关性连接超节点，较好地解决了资源准确定位的问题。②提出了一种超节点选择和动态调整超节点选择策略。该策略能根据超节点自身的负载能力，动态调整连接普通节点的数量，使超节点的选择更加简单，减少了超节点因负载过重而出现网络瓶颈的可能性。③提出一种搜索路由优化机制，使检索尽可能在某个语义组内完成，减少了查询请求转发次数，进一步减少了查询带宽消耗、提高了搜索效率和检索结果。
（2）在节点共享文档组织方面，为了克服已有共享文档组织方法不利于构建语义覆盖网络的问题，提出一种基于层次聚类树的超节点对等网络。主要工作包括：①改进了传统层次聚类算法，以适应多文档集聚类。采用该算法将节点共享文档集聚类，根据簇之间的语义范畴形成层次聚类树，克服了传统单层次聚类很难揭示文档之间语义关系的不足。②在层次聚类树的构建过程中，利用曲线多项式拟合技术，设计一种自动发现并设置阈值的方法。这种方法使聚类过程更加智能化和自动化，聚类结果更加准确。③提出了基于层次聚类树的超节点对等网络构建方法。利用该方法，普通结点能根据网络中已有语义组的语义范畴，选择不同层次的簇与超节点建立连接，提高了搜索效率、减少了查询带宽消耗。
（3）在超节点拓扑结构方面，针对已有超节点对等网络中超节点拓扑结构复杂、无序，难维护、不便于搜索路由等问题，提出了两类常数度数的超节点拓扑结构模型。主要工作包括：①在分析完美差异图（PDG）结构的基础上，提出一种新的k-PDG拓扑结构，并利用该结构组织超节点，建立了一种新的超节点对等网络。②提出一种新的k-皮特森图拓扑结构。采用改进的皮特森图，将网络中超节点按照k-皮特森图拓扑结构进行组织，建立了一种新的超节点对等网络。性能分析和模拟结果表明：这两类结构与现有超节点拓扑结构相比，除具有支持多关键词查询、减少搜索所产生的查询消息量外，在动态适应性方面，新超节点对等网络能更好地降低超节点失效对拓扑产生的影响；在性能上，该网络具有更小的拓扑构造和失效修复成本。
（4）在分布式查询方面，针对现有超节点对等网络中超节点负担重，查询结果缺乏统一排序、包含重复结果的下载节点可能无效等问题，提出一种低负载和高质量的分布式查询处理机制。主要工作包括：①提出一种分布式查询处理机制，减少了超节点的查询负载。②提出一种基于近似全局信息的分布式排序方法，实现对查询结果进行统一排序。③提出一种下载节点选择机制，提高了下载请求的成功率、减少响应时间和网络通信消耗。
（5）原型系统的设计和实现。将本文研究成果，如节点共享文档组织方法、超节点构建算法、超节点拓扑结构、分布式查询处理等关键技术加入到系统中，设计与实现了一个原型系统。
The peer-to-peer (P2P) networks have been playing an important role in thefields of information retrieving and file sharing in view of the characteristics of thedistributed data storage, the equivalence of nodes and the direct communicationbetween nodes, and so on. Along with the growing network scale is larger and larger,the network bottleneck and node failure problems are more likely to arise. Becausethe super node network has potential advantage such as high search efficiency, rapidpositioning, fault-tolerant, scalable and so on, In order to solve the problems, peoplebased on the Super-Peer networks information retrieval start to make a preliminarystudy. However existing researches results have still some shortcomings, there arestill many key problems need to be solved. Such as, how to construct a Super-Peernetwork according to the semantic similarity principle to further improve the searchefficiency and the quality of search; how to design super-peers topology structurewith constant degree to further reduce network maintenance cost; how to designfailure node, link failure detection and recovery mechanism to improve the networkfault tolerance; how to establish mechanism of distributed query to reduce the supernodes load, improve the quality of retrieval results and results downloading. Solvingthese key problems will be helpful for users to meet the needs of information retrieval,to provide users with more convenient and efficient information retrieval platform.Therefore, there are important theory values and the practical significances toresearch network information retrieval in Super-Peer networks.
This paper aims at improving the searching efficiency, the quality of search anddownload quality, reducing network maintenance cost, enhancing network faulttolerance as well, which research the key problems, utilize the study results designand implementation of prototype system. The aspects of main research contents andcontributions include as following:
(1) In the aspects of the Super-Peer networks construction, earlier Super-Peernetworks have some defects, such as the connections between super-peers andclient-peers lack of semantic relevance, the search efficiency and the quality ofretrieval results are not high, and it does not deal with the super-peer load balance. Anovel method of constructing super-peers networks based on online cluster isproposed. The main research contents include: Firstly, an improved online cluster algorithm is proposed to be applied to high dynamically peer-to-peer networks. Thisalgorithm ensures every super-peer having strong semantic relativity with theclient-peers joined, thus provides a good solution to the problem of accurate locatingresources. Secondly, the method adopts an adaptive dynamically adjustment strategyfor choosing super-peers when client peers connect the super-peer. With the strategy,super-peers can dynamically adjust the number of client peers according to itsoverlaod capacity. It makes simply for selecting super-peer, and solves networkbottle-neck problem caused by overloading super-peer with the networks sizeenlarging. Thirdly, the theme also raises an optimized searching mechanism toimprove search efficiency and retrieval result.
(2) In the aspects of organization and management of shared documents, currentmethods of organizing shared documents are not effective to construct semanticoverlay networks. In order to overcome the drawbacks, this theme proposes atechnique called Super-Peer Network based on Hierarchical Cluster Trees. The mainresearch contents include: Firstly, a new algorithm is proposed to arrange sharedocuments in peers into hierarchical cluster tree structures according to clustersemantic features. This tree structure is logical in term of arranging clusters, and therelationship between clusters is more clearly reflected compared to the one-level, flatstructure. Secondly, for a hierarchical cluster tree, a method is proposed based onmultinomial simulation technique. By this method, clusters can be dynamicallygenerated or merged according the semantic feature of related clusters and documents,rather than having a fixed threshold which was used in earlier methods. Thirdly, aconstruction method for Super-Peer network based on Hierarchical Cluster Trees hasbeen developed, so that different level clusters at client peers can establish links tothe clusters trees of super peers of semantic overlay networks according to cluster anddocument feature similarities, to improve the search efficiency and decrease networkbandwidth cost.
(3) In the aspects of super-peers topology structures, existing networks topologystructures have some defects, such as complex maintenance and consuming anexcessive amount of bandwidth. Two constant degree super-peers topology structuresare proposed. The main research contents include: Firstly, a new Super-Peer networkis proposed by analyzing the characters of perfect difference graph (PDG), a novelk-PDG structure and the corresponding super-peer overlay topology construction andmaintenance approaches are proposed. Secondly, a novel k-Petersen graph is proposedby analyzing the characteristics and the deficiencies of Petersen graph, a new Super-Peer network based on k-Petersen graph. Compared with existed super-peertopologies, the new super-peers toplogies scheme support approximate query, andreduce the bandwidth consumption during search and decrease the cost of topologyconstruction and maintenance.
(4) In the aspects of distributed query, for existed super-peers networks havesome faults such as retrieval result global ranked, duplicated and invalid downloadpeers, a mechanism of low overload and high quality distributed is proposed. Themain research contents include: Firstly, a method of building data index and selectingquery-peer in a super-peer is presented to decrease super-peer burden. Secondly, adistributed ranking approach based on global information is addressed, to solveretrieval results rank. Thirdly, a strategy of selecting downloading peers forduplicated results to reduce retrieval overlap, network transfers cost and responsetime.
(5) A prototype system of information retrieval in Super-Peers network isdesigned and implemented. Researches presented in this paper are realized in theprototype system, such as the method of organizing shared documents, the algorithmto construct super-peer networks, the mechanism of searching and sorting retrievalresults, and so on.
引文
[1] Stefan Saroiu, Krishna P. Gummadi, Steven D. Gribble. Measuring andanalyzing the characteristics of Napster and Gnutella hosts. Multimedia System,2003,9(2):170-184
[2] Pipeanu M.. Peer-to-Peer architecture case study: Gnutell network. In: Proc. ofPeer-to-Peer Computing. Linkoping, Sweden,2001,99-100
[3] PHui Zhang, PAshish Goel, PRamesh Govindan. Using the samll-world modelto improve Freenet performance. Computer Networks: The International Journalof Computer and Telecommunications Networking,2004,46(4):555-574
[4] S. Ratnasamy, P. Francis, M. Handley, et al. A Scalable Content-addressablenetwork. In: Proc. of the ACM SIGCOMM2002Conference on Applications,Technologies, Architectures, and Protocols for Computer Communication. NewYork: ACM Press,2002,31(4):161-172
[5] Stoica, R. Morris, D. Karger, et al. Chord: A scalable peer-to-peer lookupservice for internet applications. In: Proc. of the ACM SIGCOMM2001Conference on Applications, Technologies, Architectures, and Protocols forComputer Communication. CA, USA,2001,149-160
[6] Antony Rowstron, Peter Druschel. Pastry: Scalable, distributed object locationand routing for large-scale peer-to-peer systems. In: Proc. of IFIP/ACMInternational conference on Distributed systems platforms (Middle ware).Heidelberg, Germany,2001,329-350
[7] Ben Y. Zhao, Ling Huang, Jeremy Stribling, et al. Tapestry: A ResilientGlobal-Scale Overlay for Service Deployment. IEEE Jouranl on Selected Areasin Communications,2004,22(1):41-53
[8] KaZaA website. http://www.kazaa.com,2005-10-7
[9]凌波,陆志国,黄维雄等. PeerIS:基于Peer-to-Peer的信息检索系统.软件学报,2004,15(9):1375-1384
[10]陈海涛,龚正虎,黄遵国. GBSS:基于分组的语义搜索研究.通信学报,2006,27(1):21-27
[11]夏启志,谢高岗,闵应骅等. IS-P2P:一种基于索引的结构化P2P网络模型.计算机学报,2006,29(4):602-610
[12] Beverly Yang, Hector Garcia-Molina. Designing a Super-Peer Network. In:Proc. of the19th International Conference on Data Engineering. Bangalore,India,2003,49-60
[13] W. Nejdl, M. Wolpers, W. Siberski, et al. L¨oser.Super-peer-based routingstrategies for RDF-based peer-to-peer networks. Journal of Web Semantics,2004,1(2):177-186
[14] C.Tang, S.Dwarkadas. Hybrid global-local indexing from efficient peer-to-peerinformation retrieval. In: Proc. of1st Symposium on Networked SystemsDesign and Implementation. San Francisco, CA, USA,2004,211-224
[15] G. G. Chowdhury. Introduction to Modern Information Retrieval. second edition.London: Facet Publishing,2004,1-240
[16] Yihong Tan, Yaping Lin, Zhiping Chen, et al. Research and Implementation onRouting Scheme Based on Interest Mining in Unstructured P2P Systems. In:Proc. of seventh International Conference on Web-Age InformationManagement Workshops. HongKong, China,2006,145-151
[17] Naomi AOKI, Satoshi FUJITA. An Improved Scheme for Interest Mining Basedon a Reconfiguration of the Peer-to-Peer Overlay. In: Proc. of FifthInternational Workshop on Computational Intelligence&Applications.Hiroshima University, Japan,2009,147-152
[18] Aoki, N., Fujita, S.. Tit-for-Tat Reconfiguration Rule for Unstructured P2Ps andIts Evaluation. In: Proc. of2010International Symposium on Parallel andDistributed Processing with Applications. Taipei,2010,249-256
[19] C.Tang, Z. Xu, S.Dwarkadas. Peer-to-Peer Information Retrieval UsingSelf-organizing Semantic overlay networks. In: Proc. of the ACM SIGCOMMworkshop on Models, methods and tools for reproducible network research.Karlsruhe, Germany,2003,25-29
[20] Edith Cohen, Amos Fiat, Haim Kaplan. Associative Search in Peer-to-PeerNetworks: Harnessing Latent Semantics. Computer Networks,2007,51(8):1861-1881
[21] Bisignano M., Di Modica G.,Tomarchio, O.. A Semantic P2P Overlay Networkfor Web Service Discovery. In: Proc. of International Conference onNetwork-Based Information Systems. Indianapolis, IN,2009,60-66
[22] Giuseppe Di Modica, Orazio Tomarchio, Lorenzo Vita. Resource and servicediscovery in SOAs: A P2P oriented semantic approach. International Journal ofApplied Mathematics and Computer Science,2011,21(2):285-294
[23] M.Berry, Z.Drmac, E.Jessup. Matrices. VectorSpaces, and InformationRetrieval. SIAM Review,1999,41(2):335-362
[24] J.Lv, X.Cheng. Wongoo: A Pure Peer-to-Peer Full Text Information RetrievalSystem Based on Semantic Overlay Networks. In: Proc. of the Third IEEEInternational Symposium on Network Computing and Applications. Cambridge,Massachusetts, USA,2004,47-54
[25] H.Rostami, J. Habibi, H.Abolhassani, et al. An Ontology Based Local Index inP2P Networks. In: Proc. of the Second International conference on Semantics,Knowledge, and Grid. Guilin, China,2006,11-14
[26] Yuh-Jzer Joung, Feng-Yuan Chuang. OntoZilla: An Ontology-Based,Semi-structured, and Evolutionary Peer-to-Peer Network for InformationSystems and Services. Future Generation Computer Systems,2009,25(1):53-63
[27]陈汉华,金海,宁小敏等. SemreX:一种基于语义相似度的P2P覆盖网络.软件学报,2006,17(5):1170-1181
[28] Elena Pagani, Gian Paolo Rossi, Enrico Pertoso. ORION-Ontology-based queRyroutiIng in Overlay Networks. Journal of Parallel and Distributed Computing,2009,69(1):28-38
[29] Leo Obrst. Ontologies for Semantically Interoperable Systems. In: Proc. of thetwelfth international conference on Information and knowledge management.New Orleans. USA,2003,37-40
[30] E. Sidirourgos, G. Kokkinidis G.. Efficient Query Routing in RDF/Sschema-based P2P System. In: Proc. of the4th Hellenic Data ManagementSymposium. Athens, Greece,2005,120-129
[31] Gilles Nachouki, Marie-Pierre Chastang. Multi-data Source Fusion Approach inPeer-to-Peer Systems. International Journal of Database Management Systems,2011,2(1):60-69
[32] M. Eisenhardt, W. Mueller, A. Henrich. Classifying Documents by DistributedP2P Clustering. In: Proc. of INFORMATIK2003.Frankfort, Germany,2003,286–291
[33] C. Tempich, S. Staab, A. Wranik. REMINDIN': Semantic Query Routing inPeer-to-Peer Networks based on Social Metaphors. In: Proc. of the13ndInternational World Wide Web Conference. New York, USA,2004,640-649
[34] Peter Merz, Mathias Priebe, Steffen Wolf. Super-Peer selection in Peer-to-Peernetworks using network coordinates. In: Proc. of Third International Conferenceon Internet and Web Applications and Services. Athens, Greece Athens,2008,385-390
[35] Alberto Garc′a-Sola, Juan A. Botia. Creation of Semantic Overlay NetworksBased on Personal Information. In: Proc. of the10th InternationalWork-Conference on Artificial Neural Networks. Salamanca,2009,75-82
[36] Wei Gao, Guoyin Zhang, Xi Wang, et al. A study on semantic overlay networktopology of P2P based on node location. In: Proc. of2010InternationalConference on Advanced Intelligence and Awareness Internet. Beijing,China,2010,33-36
[37] Guha, S., Rastogi, R., Shim, K. CURE: An efficient clustering algorithm forlarge databases. In: Proc.of ACM-SIGMOD on Management of Data. NewYork:ACM Press,1998,27(2):73–84
[38] Dhillon I.S.,Modha, D.S. Concept decompositions for large sparse text datausing clustering. Machine Learning,2001,42(1/2):143–175
[39] Ying Zhao, George Karypis. Hierarchical Clustering Algorithms for DocumentDatasets. Data Mining and Knowledge Discovery,2005,10(2):141-168
[40] Gnutella protocol RFC spec. v.0.6. http://rfc-gnutella.sourceforge.net,2004-9-1
[41] Qin Lv, Pei Cao, Edith Cohen. Search and Replication in UnstructuredPeer-to-Peer Networks. In: Proc. of International Conference on Supercom-puting. New York, USA,2002,24-35
[42] Gkantsidis C., Mihail M., Saberi A. Random walks in peer-to-peer networks. In:Proc. of the23rd Conference of the IEEE Communications Society. HongKong,China,2004,1-12
[43] B. Yang, H. Garcia-Molina. Improving Search in peer-to-peer networks. In:Proc. of the22ndInternational Conference on Distributed Computing System,Ienna, Austria,2002,5-14
[44] Christos Gkantsidis, Milena Mihail, Amin Saberi. Random walks inpeer-to-peer networks: Algorithms and evaluation. Performance Evaluation,2006,63(3):241-263
[45] Nabhendra Bisnika, Alhussein A. Abouzeid. Optimizing random walk searchalgorithms in P2P networks. Computer Networks,2007,51(6):1499-1514
[46] Noga Alon, Chen Avin, Michal Koucky, et al. Many random walks are fasterthan one. In: Proc. of the twentieth annual symposium on Parallelism inalgorithms and architectures. Munich, Germany,2008,59-68
[47] Mei Li, Wang-Chien Lee, Sivasubramaniam A.. Semantic small world: anoverlay network for peer-to-peer search. In: Proc. of the12th IEEE InternationalConference on Network Protocols. Berlin, Germany,2004,228–238
[48] Cohen E., Fiat A., Kaplan H.. Associative search in peer to peer networks:harnessing latent semantics. In: Proc. of Twenty-Second Annual JointConference of the IEEE Computer and Communications. CA: IEEE ComputerSociety Press,2003,30(3):1261-1271
[49] Kalogeraki V., Gunopulos D., Zeinalipour-Yazti D. A Local Search Mechanismfor Peer-to-Peer Networks. In: Proc. of11th International Conference onInformation and Knowledge Management. McLean, Virginia, USA,2002,300-307
[50] E. Cohen, S. Shenker. Replication Strategies in Unstructured Peer-to-PeerNetworks. In: Proc. of the Conference on Applications, technologies,architectures, and protocols for computer communications. New York: ACMPress,2002,32(4):177-190
[51]冯国富,张金城,顾庆等.一种基于覆盖网络拓扑的无结构主动复制策略.软件学报,2007,18(9):2226-2234
[52] Crespo, H. Garcia-Molina. Routing Indices for Peer-to-Peer Systems. In: Proc.of22nd International Conference on Distributed Computing Systems. Vienna,Austria,2002,23-32
[53] Kumar, A., Xu, J., Zegura, et al. Efficient and scalable query routing forunstructured peer-to-peer networks. In: Proc. of24th Annual Joint Conferenceof the IEEE Computer and Communications Societies. Miami, USA,2005,1162-1173
[54] Shiping Chen, Zhan Zhang, Shigang Chen, et al. Efficient file search innon-DHT P2P networks. Computer Communications,2008,31(2):304-317
[55] Utku Günay Acer, Shivkumar Kalyanaraman, Alhussein A. Abouzeid. Weakstate routing for large-scale dynamic networks. IEEE/ACM Transactions onNetworking,2010,18(5):1450-1463
[56] Christoph Schmitz. Self-organization of a Small World by Topic. In: Proc. of1st International Workshop on Peer-to-Peer Knowledge Management. Boston,MA, USA,2004,303-310
[57]周晋,路海明,李衍达.用Small-World设计无组织P2P系统的路由算法.软件学报,2004,15(6):915-923
[58]汤大权,贺明科,孟庆崧.基于幂律分布和小世界特性的无结构P2P网络中搜索方法研究.计算机研究与发展,2007,44(9):1566-1571
[59] K. Sripanidkulchai, B. Maggs, H. Zhang. Efficient Content Location UsingInterest-Based Locality in Peer-to-Peer Systems. In: Proc. of22nd Annual JointConference on the IEEE Computer and Communications Societies. SanFrancisco, CA, USA,2003,2166-2176
[60] D. Zeinalipour-Yazti, V. Kalogeraki, D. Gunopulos. Exploiting locality forscalable information retrieval in peer-to-peer networks. Information Systems,2005,30(4):277–298
[61]曹迎春,王义麟,陈建忠等.一种基于语义相似的P2P搜索机制.计算机科学,2007,34(5):52-56
[62] Benjamin Arai, Gautam Das, Dimitrios Gunopulos, et al. Efficient ApproximateQuery Processing in Peer-to-Peer Networks. IEEE Transactions on Knowledgeand Data Engineering,2007,19(7):919-933
[63] Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghavan. SETS: SearchEnhanced by Topic Segmentation. In: Proc. of the26th Annual InternationalACM SIGIR Conference on Research and Development in InformationRetrieval. Toronto, Canada,2003,305-313
[64]钱宁,吴国新,赵生慧.基于贝叶斯网络的无结构化P2P资源搜索方法.计算机研究与发展,2009,46(6):889-897
[65] Rongmei Zhang, Y.Charlie Hu. Assisted Peer-to-Peer Search with PartialIndexing. IEEE Transactions on Parallel and Distributed Systems,2007,18(8):1146-1158
[66]冯国富,毛莺池,陆桑璐等. PeerRank:一种无结构P2P资源发现策.软件学报,2006,17(5):10981106
[67] Yingwu Zhu, Yiming Hu. Enhancing Search Performance on Gnutella-Like P2PSystems. IEEE Transactions on Parallel and Distributed Systems,2006,17(12):1482-1495
[68] Ishak, Iskandar, Salim, et al. Query routing using query feedback and similarityin unstructured peer to peer networks. International Journal of ComputerScience and Network Security,2008,8(8):24-29
[69] Lodi S., Mandreoli F., Martoglia R., et al. Semantic Peer, Here are theNeighbors You Want! In: Proc. of the11thInternational Conference onExtending Database Technology. Nantes, France,2008,26-37
[70]杨舰,吕智慧,钟亦平等.一种基于兴趣域的高效对等网络搜索方案.计算机研究与发展,2005,42(5):804～809
[71] Loo A. the Future or Peer-to-Peer Computing. Communications of the ACM,2003,46(9):51-61
[72] Yang B., H. Garcia-Molina. Comparing Hybrid Peer-to-Peer Systems. In: Proc.of27thInternational Conference on Very Large Data Bases. Rome, Italy,2001,54-63
[73] Loser, W.Nejdl, M.Wolpers, et al. Information Integration in Schema-BasedPeer-To-Peer Networks. In: Proc. of the15th Conference on AdvancedInformation Systems Engineering. Klagenfurt/Velden, Austria,2003,258-272
[74] P. Druschel, A. Rowstron. PAST: A Large-Scale Persistent Peer-to-Peer StorageUtility. In: Proc. of8th Workshop on Hot Topics in Operating Systems. SchlossElmau, Germany,2001,48-53
[75] Oceanstore project homepage. http://oceanstore.cs.berkeley.edu/,2006-7-5
[76] F. Dabek, M. F. Kaashoek, D. Karger, et al. Wide-area cooperative storage withcfs. In: Proc. of the18th ACM symposium on Operating systems principles.Banff, Canada,2001,202-215
[77] Feng Z, Li Z, Ben Y, et al. Approximate object location and spam filtering onpeer-to-peer systems. In: Proc. of the ACM/IFIP/USENIX2003InternationalConference on Middleware. Rio de Janeiro, Brazil,2003,1-20
[78] Reynolds P, Vahdat A. Efficient peer-to-peer keyword searching. In: Proc. ofthe ACM/IFIP/USENIX2003International Conference on Middleware. Rio deJaneiro, Brazil,2003,21-40
[79] BHARAMBE A R, AGRAWAL M, SESHAN S. Mercury: supporting scalablemulti-attribute range queries. In: Proc. of the ACM SIGCOMM2004Conference on Applications, Technologies, Architectures, and Protocols forComputer Communication. Portland, Oregon, USA,2004,353-366
[80]宋建涛,沙朝锋,杨智应等.语义对等网构造及搜索机制研究.计算机研究与发展,2004,41(4):645-652
[81]傅向华,冯博琴.一种支持复杂查询的有组织P2P搜索方法.小型微型计算机系统,2006,27(3):401-406
[82] Podnar I., Rajman M., Luu F., et al. Scalable Peer-to-Peer Web Retrieval withHighly Discriminative Keys. In: Proc. of IEEE23rd International Conference onData Engineering. Istanbul,2007,1096-1105
[83] Cristina Schmidt, Manish Parashar. Squid: Enabling search in DHT-basedsystems. Journal of Parallel and Distributed Computing,2008,68(7):962-975
[84]赵秀梅,刘方爱.支持串模糊匹配的Chord扩展资源索引模型.计算机应用研究,2009,26(12):4648-4651,4655
[85] Crespo,H. Garcia-Molina. Semantic Overlay Networks for P2P Systems. In:Proc. of the Third International Workshop on Agents and Peer-to-PeerComputing. New York, USA,2004,1-13
[86] Strassner J.. A Hierarchical Semantic Overlay System for Semantic Search andService Matchmaking. In: Proc. of the Fourth International Conference on NextGeneration Mobile Applications, Services and Technologies. Amman, Jordan2010,42-47
[87] Xia Zhanguo, Xia Shixiong, Wang Zhixiao, et al. A Field-Based Semantic P2POverlay Network. In: Proc. of4th International Conference on WirelessCommunications, Networking and Mobile Computing. Dalian, China,2008,1-4
[88] Gopalan, K.S. Improved search latency in peer to peer networks with contentlinks. In: Proc. of2009IEEE International Conference on Internet MultimediaServices Architecture and Applications. Bangalore,2009,1-6
[89] Liu Jie, Zhuge Hai. A semantic-based P2P resource organization modelR-Chord. Journal of systems and software,2006,79(11):1619-1631
[90]刘业,杨鹏.基于自组织聚类的结构化P2P语义路由改进算法.软件学报,2006,17(2):339-348
[91] Doulkeridis, K. N rv°ag, M. Vazirgiannis. DESENT: Decentralized andDistributed Semantic Overlay Generation in P2P Networks. IEEE Journal onSelected Areas in Communications,2007,25(1):25-34
[92] Baiyou Qiao, Guoren Wang, Kexin Xie. A Taxonomy-Based Approach forConstructing Semantics-Based Super-Peer Networks. In: Proc. of The JointAsia-Pacific Web Conference and Web-Age Information Management.Huanshan, China,2007,122-134
[93] T. Suel, C. Mathur, J. Wu, et al. Odissea: A peer-to-peer architecture forscalable web search and information retrieval. In: Proc. of the InternationalWorkshop on the Web and Databases. San Diego, California,2003,67-73
[94]何盈捷,王栅,杜小勇.纯Peer to Peer环境下有效的top-k查询.软件学报,2005,16(4):540-552
[95] W.-T. Balke, W. Nejdl, W. Siberski, et al. Progressive Distributed Top-kRetrieval in Peer-to-Peer Networks. In: Proc. of the21th InternationalConference on Data Engineering. Tokyo, Japan,2005,174-185
[96] Chernov S, Serdyukov P, Bender M, et al. Database selection and resultmerging in P2P web search. In: Proc. of the international conference onDatabases, information systems, and peer-to-peer computing Trondheim.Norway, Berlin,2007,26-37
[97]凌波,周永康,周傲英. P2P信息检索系统的查询结果排序与合并策略.计算机学报,2007,30(3):405-414
[98] Akrivi Vlachou, Christos Doulkeridis, Kjetil N rv g, et al. On Efficient Top-kQuery Processing in Highly Distributed Environments. In: Proc. of theinternational conference on Management of data. BC, Canada,2008,753-764
[99] Zhitao Guan, Guangwei Yan, Heqing Huang. A Novel Top-k Query Scheme inUnstructured P2P Networks. In: Proc. of Ninth IEEE International Conferenceon Computer and Information Technology. Xiamen, China,2009,16-21
[100] S.Airiau, S.Sen, P.Dasgupta. Effect of Joining Decisions on Peer Clusters. In:Proc. of the fifth International Joint Conference on Autonomous Agents andMultiagent System. Hakodate, Hokkaido, Japan,2006,609-615
[101] Loser, F.Naumann, W.Siberski, et al. Semantic Overlay Clusters withinSuper-Peer Netwoks. In: Proc. of International1th workshop on database,Information Systems and Peer-to-Peer Computing. Berlin, Germany,2003,33-47
[102] Seungwon Shin, Jaeyeon Jung, Hari Balakrishnan. Malware prevalence in theKaZaA file-sharing network. In: Proc. of the6th ACM SIGCOMM conferenceon Internet measurement. Rio de Janeriro, Brazil,2006,333-338
[103] W. Liu, J. Yu, J. Song, et al. ERASP: An Efficient and Robust Adaptive Superpeer Overlay Network. In: Proc. of the10th Asia Pacific Web Conference.Shenyang, China,2008,468-474
[104] Garbacki P., Dick H. J. E., Van Steen M.. The Design and Evaluation of aSelf-Organizing Superpeer Network. IEEE TRANSACTIONS ON COMPU-TERS,2010,59(3):317-331
[105] M. Liu, J. Zhou, T. Koskela. A Robust Algorithm for the MembershipManagement of Super-Peer Overlay. In: Proc. of the12th IFIP/IEEEInternational Conference on Management of Multimedia and Mobile Networksand Services: Wired-Wireless Multimedia Networks and Services Management.Venice, Italy,2009,132-143
[106] V. Lo, D. Y, C. G, et al. Scalable Supernode Selection in Peer-to-Peer OverlayNetworks. In: Proc. of the2005Second International Workshop on Hot Topicsin Peer-to-Peer Systems. OR, USA,2005,18-25
[107] Su-Hong Min, Joanne Holliday, Dong-Sub Cho. Optimal Super-peer Selectionfor Large-scale P2P System. In: Proc. of2006International Conference onHybrid Information Technology. Jeju Island, Korea,2006,588-593
[108] Suhong Min, Dongsub Cho. Super-Peer Selection Based Framework UsingDynamic Capacity and Similarity. In: Proc. of the21st International Symposiumon Computer and Information Sciences. Istanbul, Turkey,2006,803–812
[109] Montresor. A robust protocol for building super peer overlay topologies. In:Proc. of the4th International Conference on Peer-to-Peer Computing. Tokyo,Japan,2004,202-209
[110]郑倩冰,彭伟,卢锡城. ERSN:一种高效鲁棒的超节点对等网络.计算机研究与发展,2006,43(4):607-612
[111] Jenn-Wei Lin, Ming-Feng Yang. Robust Super-Peer-Based P2P File-SharingSystems. The Computer Journal,2010,53(7):951-968
[112]王继成,潘金贵,张福炎. Web文本挖掘技术研究.计算机研究与发展,2000,37(5):513-520
[113] R.O. Duda a, P.E. Hart. Pattern Classification and Scene Analysis. New York:John Wiley and Sons.1973,1-304
[114] Duda,R.O..模式分类.李宏东.第2版.北京:机械工业出版社,2003.9,1-140
[115] Zrhuts EW, Calvert KL, Bhattacharjee S. How to model an internetwork. In:Proc.of the Fifteenth Annual Joint Conference of the IEEE Computer Societies.Networking the Next Generation. San Francisco, USA,1996,594-602
[116] Buckley C. Implementation of the SMART information retrieval system.http://hdl.handle.net/1813/6526,2005-05-10
[117] R.Hayek, G.Raschia, P.Valduriez, et al. Summary Management in P2P Systems.In: Proc. of the11th international conference on Extending database technology:Advances in database technology. Nantes, France,2008,16-25
[118] Jiadi Yu, Minglu Li. CBT: A Proximity-Aware Peer Clustering System inLarge-Scale BitTorrent-like Peer-to-peer Networks. Computer Communi-cations,2008,31(3):591-602
[119] Christos Doulkeridis, Akrivi Vlachou, Kjetil N rv g, et al. Efficient SearchBased on Content Similarity over Self-Organizing P2P Networks. Peer-to-PeerNetworking and Applications,2010,3(1):67-79
[120] Paraskevi Raftopoulou, Euripides G., Christos Tryfonopoulos. RewiringStrategies for Semantic Overlay Networks. Distributed and Parallel Databases,2009,26(2-3):181-205
[121] K. Hammouda, M. Kamel. Collaborative Document Clustering. In: Proc. of theSixth SIAM International Conference on Data Mining. Bethesda, MD,2006,453–463
[122] Yanjun Li, Soon M. Chung, John D. Holt. Text Document Clustering Based onFrequent Word Meaning Sequences. Data&Knowledge Engineering,2008,64(1):381-404
[123] HaiJin, hanhua Chen. SermeX: Efficient Search in a Semantic Overlay forLiterature Retrieval. Future Generation Computer System,2008,24(6):475-488
[124] Habib Rostami, JafarHabibib, Emad Livani. Semantic Partitioning ofPeer-to-Peer Search Space. Computer Communications,2009,32(4):619-633
[125] Stephen J., H. Yang, Jia Zhang, et al. Improving Peer-to-Peer SearchPerformance through Intelligent Social Search. Expert Systems withApplications,2009,36(7):10312-10324
[126] P. Garbacki, D. H. J. Epema, M. van Steen. Optimizing Peer Relationships in aSuper-Peer Network. In: Proc. of27th IEEE International Conference onDistributed Computing Systems. Toronto, ON,2007,31-40
[127] Chawathe Y, Ratanasamy S, Breslau L, et al. Making gnutella-like P2P systemsscalable In: Proc. of the2003conference on Applications, technologies,architectures, and protocols for computer communications. Karlsruhe,Germany,2003,407-418
[128] LIN Tsunghan, HO Tsunghsuan, CHAN Yuwei, et al. M-Ring: A Distributed,Self-Organized, Load-Balanced Communication Method on Super Peer NetworkIn: Proc. of the International Symposium on Parallel Architectures, Algorithms,and Networks. Sydney, NSW,2008,59-64
[129] LI Jung-Shian, CHAO Chih-Hung. An Efficient Superpeer OverlayConstruction and Broadcasting Scheme Based on Perfect Difference Graph.IEEE Transactions on Parallel and Distributed Systems,2010,21(5):594-606
[130] Carlo Mastroianni, Pasquale Cozza, Domenico Talia, et al. A ScalableSuper-Peer Approach for Public Scientific Computation. Future GenerationComputer Systems,2009,25(3):213-223
[131] Yu Ge, Ting Yan. Similarity-Based Semantics Searching in Super-Peer NetworkModel. In: Proc. of International Conference on Internet Technology andApplications. Wuhan, China,2010,1-4
[132] Pyun Y J, Revevs D. S. Constructing a Balanced,(log(N)/loglog(N))-DiameterSuper-Peer Topology for Scalable P2P Systems. In: Proc. of FourthInternational Conference on Peer-to-Peer Computing. Zurich, switzer-land,2004,210-218
[133] HAN Hongmu, HE Jie, ZUO Cuihua. A hybrid P2P overlay network for highefficient search. In: Proc. of2nd IEEE International Conference on Informationand Financial Engineering. Chongqing, China,2010,241-245
[134]梁活民,肖文俊.一种具有小世界网络特征的常数度结构化覆盖网络.计算机学报,2010,33(9):1541-1547
[135] Mario Schlosser, Michael Sintek, Stefan Decker, et al.. HyperCuP-Hypercubes,Ontologies, and Efficient Search on Peer-to-Peer Networks. In: Proc. of FirstInternational Workshop on Agents and peer to peer computing. Bologna, Italy,2002,112-124
[136] PARHAMI B, RAKOV M A. Performance, Alogorithmic, and RobustnessAttributes of Perfect Difference Networks. IEEE Transactions On Parallel andDistributed Systems,2005,16(8):725-736
[137]刘方爱,乔香珍,刘志勇.一种实用的互联网络拓扑结构RP(k)及路由算法.中国科学E辑,2002,32(3):380-385
[138] CALVERT K, EAGAN J, MERUGU S, et al. Extending and EnhancingGT-ITM. In: Proc. of the ACM SIGCOMM workshop on Models, methods andtools for reproducible network research. Karlsruhe, Germany,2003,23-27
[139] Tang Chun-Qiang, Xu Zhi-Chen. pSearch: Information retrieval in structuredoverlays. Computer Communication Review,2003,33(1):89-94
[140] N.Fuhr. A decision-theoretic approach to database selection in networked IR.ACM Transactions on Information Systems,1999,17(3):229-249
[141] Z.Nie, S.Kambhampati, T.Hernandez. Statminer:Effectively mining and usingcoverage and overlap statistics in data integration. In: Proc. the InternationalConference on Very Large Data Bases. Berlin, Germany,2003,1097-1100
[142] Y.Zhang, J.Callan, T.Minka. Novelty and redundancy detection in adaptivefiltering. In: Proc. of the International Conference on Management of data. BC,Canada,2002,81-88
[143] N. Fuhr. A decision-theoretic approach to database selection in networked IR.ACM Transactions on Information Systems,1999,17(3):229-249
[144] Ng W.S, Ooi B.C, Tan K.L. BestPeer: A self-configurable Peer-to-Peer system.In: Proc. of the18th International Confernece on Data Engineering. San Jose,CA, USA,2002,272-276
[2] Pipeanu M.. Peer-to-Peer architecture case study: Gnutell network. In: Proc. ofPeer-to-Peer Computing. Linkoping, Sweden,2001,99-100
[3] PHui Zhang, PAshish Goel, PRamesh Govindan. Using the samll-world modelto improve Freenet performance. Computer Networks: The International Journalof Computer and Telecommunications Networking,2004,46(4):555-574
[4] S. Ratnasamy, P. Francis, M. Handley, et al. A Scalable Content-addressablenetwork. In: Proc. of the ACM SIGCOMM2002Conference on Applications,Technologies, Architectures, and Protocols for Computer Communication. NewYork: ACM Press,2002,31(4):161-172
[5] Stoica, R. Morris, D. Karger, et al. Chord: A scalable peer-to-peer lookupservice for internet applications. In: Proc. of the ACM SIGCOMM2001Conference on Applications, Technologies, Architectures, and Protocols forComputer Communication. CA, USA,2001,149-160
[6] Antony Rowstron, Peter Druschel. Pastry: Scalable, distributed object locationand routing for large-scale peer-to-peer systems. In: Proc. of IFIP/ACMInternational conference on Distributed systems platforms (Middle ware).Heidelberg, Germany,2001,329-350
[7] Ben Y. Zhao, Ling Huang, Jeremy Stribling, et al. Tapestry: A ResilientGlobal-Scale Overlay for Service Deployment. IEEE Jouranl on Selected Areasin Communications,2004,22(1):41-53
[8] KaZaA website. http://www.kazaa.com,2005-10-7
[9]凌波,陆志国,黄维雄等. PeerIS:基于Peer-to-Peer的信息检索系统.软件学报,2004,15(9):1375-1384
[10]陈海涛,龚正虎,黄遵国. GBSS:基于分组的语义搜索研究.通信学报,2006,27(1):21-27
[11]夏启志,谢高岗,闵应骅等. IS-P2P:一种基于索引的结构化P2P网络模型.计算机学报,2006,29(4):602-610
[12] Beverly Yang, Hector Garcia-Molina. Designing a Super-Peer Network. In:Proc. of the19th International Conference on Data Engineering. Bangalore,India,2003,49-60
[13] W. Nejdl, M. Wolpers, W. Siberski, et al. L¨oser.Super-peer-based routingstrategies for RDF-based peer-to-peer networks. Journal of Web Semantics,2004,1(2):177-186
[14] C.Tang, S.Dwarkadas. Hybrid global-local indexing from efficient peer-to-peerinformation retrieval. In: Proc. of1st Symposium on Networked SystemsDesign and Implementation. San Francisco, CA, USA,2004,211-224
[15] G. G. Chowdhury. Introduction to Modern Information Retrieval. second edition.London: Facet Publishing,2004,1-240
[16] Yihong Tan, Yaping Lin, Zhiping Chen, et al. Research and Implementation onRouting Scheme Based on Interest Mining in Unstructured P2P Systems. In:Proc. of seventh International Conference on Web-Age InformationManagement Workshops. HongKong, China,2006,145-151
[17] Naomi AOKI, Satoshi FUJITA. An Improved Scheme for Interest Mining Basedon a Reconfiguration of the Peer-to-Peer Overlay. In: Proc. of FifthInternational Workshop on Computational Intelligence&Applications.Hiroshima University, Japan,2009,147-152
[18] Aoki, N., Fujita, S.. Tit-for-Tat Reconfiguration Rule for Unstructured P2Ps andIts Evaluation. In: Proc. of2010International Symposium on Parallel andDistributed Processing with Applications. Taipei,2010,249-256
[19] C.Tang, Z. Xu, S.Dwarkadas. Peer-to-Peer Information Retrieval UsingSelf-organizing Semantic overlay networks. In: Proc. of the ACM SIGCOMMworkshop on Models, methods and tools for reproducible network research.Karlsruhe, Germany,2003,25-29
[20] Edith Cohen, Amos Fiat, Haim Kaplan. Associative Search in Peer-to-PeerNetworks: Harnessing Latent Semantics. Computer Networks,2007,51(8):1861-1881
[21] Bisignano M., Di Modica G.,Tomarchio, O.. A Semantic P2P Overlay Networkfor Web Service Discovery. In: Proc. of International Conference onNetwork-Based Information Systems. Indianapolis, IN,2009,60-66
[22] Giuseppe Di Modica, Orazio Tomarchio, Lorenzo Vita. Resource and servicediscovery in SOAs: A P2P oriented semantic approach. International Journal ofApplied Mathematics and Computer Science,2011,21(2):285-294
[23] M.Berry, Z.Drmac, E.Jessup. Matrices. VectorSpaces, and InformationRetrieval. SIAM Review,1999,41(2):335-362
[24] J.Lv, X.Cheng. Wongoo: A Pure Peer-to-Peer Full Text Information RetrievalSystem Based on Semantic Overlay Networks. In: Proc. of the Third IEEEInternational Symposium on Network Computing and Applications. Cambridge,Massachusetts, USA,2004,47-54
[25] H.Rostami, J. Habibi, H.Abolhassani, et al. An Ontology Based Local Index inP2P Networks. In: Proc. of the Second International conference on Semantics,Knowledge, and Grid. Guilin, China,2006,11-14
[26] Yuh-Jzer Joung, Feng-Yuan Chuang. OntoZilla: An Ontology-Based,Semi-structured, and Evolutionary Peer-to-Peer Network for InformationSystems and Services. Future Generation Computer Systems,2009,25(1):53-63
[27]陈汉华,金海,宁小敏等. SemreX:一种基于语义相似度的P2P覆盖网络.软件学报,2006,17(5):1170-1181
[28] Elena Pagani, Gian Paolo Rossi, Enrico Pertoso. ORION-Ontology-based queRyroutiIng in Overlay Networks. Journal of Parallel and Distributed Computing,2009,69(1):28-38
[29] Leo Obrst. Ontologies for Semantically Interoperable Systems. In: Proc. of thetwelfth international conference on Information and knowledge management.New Orleans. USA,2003,37-40
[30] E. Sidirourgos, G. Kokkinidis G.. Efficient Query Routing in RDF/Sschema-based P2P System. In: Proc. of the4th Hellenic Data ManagementSymposium. Athens, Greece,2005,120-129
[31] Gilles Nachouki, Marie-Pierre Chastang. Multi-data Source Fusion Approach inPeer-to-Peer Systems. International Journal of Database Management Systems,2011,2(1):60-69
[32] M. Eisenhardt, W. Mueller, A. Henrich. Classifying Documents by DistributedP2P Clustering. In: Proc. of INFORMATIK2003.Frankfort, Germany,2003,286–291
[33] C. Tempich, S. Staab, A. Wranik. REMINDIN': Semantic Query Routing inPeer-to-Peer Networks based on Social Metaphors. In: Proc. of the13ndInternational World Wide Web Conference. New York, USA,2004,640-649
[34] Peter Merz, Mathias Priebe, Steffen Wolf. Super-Peer selection in Peer-to-Peernetworks using network coordinates. In: Proc. of Third International Conferenceon Internet and Web Applications and Services. Athens, Greece Athens,2008,385-390
[35] Alberto Garc′a-Sola, Juan A. Botia. Creation of Semantic Overlay NetworksBased on Personal Information. In: Proc. of the10th InternationalWork-Conference on Artificial Neural Networks. Salamanca,2009,75-82
[36] Wei Gao, Guoyin Zhang, Xi Wang, et al. A study on semantic overlay networktopology of P2P based on node location. In: Proc. of2010InternationalConference on Advanced Intelligence and Awareness Internet. Beijing,China,2010,33-36
[37] Guha, S., Rastogi, R., Shim, K. CURE: An efficient clustering algorithm forlarge databases. In: Proc.of ACM-SIGMOD on Management of Data. NewYork:ACM Press,1998,27(2):73–84
[38] Dhillon I.S.,Modha, D.S. Concept decompositions for large sparse text datausing clustering. Machine Learning,2001,42(1/2):143–175
[39] Ying Zhao, George Karypis. Hierarchical Clustering Algorithms for DocumentDatasets. Data Mining and Knowledge Discovery,2005,10(2):141-168
[40] Gnutella protocol RFC spec. v.0.6. http://rfc-gnutella.sourceforge.net,2004-9-1
[41] Qin Lv, Pei Cao, Edith Cohen. Search and Replication in UnstructuredPeer-to-Peer Networks. In: Proc. of International Conference on Supercom-puting. New York, USA,2002,24-35
[42] Gkantsidis C., Mihail M., Saberi A. Random walks in peer-to-peer networks. In:Proc. of the23rd Conference of the IEEE Communications Society. HongKong,China,2004,1-12
[43] B. Yang, H. Garcia-Molina. Improving Search in peer-to-peer networks. In:Proc. of the22ndInternational Conference on Distributed Computing System,Ienna, Austria,2002,5-14
[44] Christos Gkantsidis, Milena Mihail, Amin Saberi. Random walks inpeer-to-peer networks: Algorithms and evaluation. Performance Evaluation,2006,63(3):241-263
[45] Nabhendra Bisnika, Alhussein A. Abouzeid. Optimizing random walk searchalgorithms in P2P networks. Computer Networks,2007,51(6):1499-1514
[46] Noga Alon, Chen Avin, Michal Koucky, et al. Many random walks are fasterthan one. In: Proc. of the twentieth annual symposium on Parallelism inalgorithms and architectures. Munich, Germany,2008,59-68
[47] Mei Li, Wang-Chien Lee, Sivasubramaniam A.. Semantic small world: anoverlay network for peer-to-peer search. In: Proc. of the12th IEEE InternationalConference on Network Protocols. Berlin, Germany,2004,228–238
[48] Cohen E., Fiat A., Kaplan H.. Associative search in peer to peer networks:harnessing latent semantics. In: Proc. of Twenty-Second Annual JointConference of the IEEE Computer and Communications. CA: IEEE ComputerSociety Press,2003,30(3):1261-1271
[49] Kalogeraki V., Gunopulos D., Zeinalipour-Yazti D. A Local Search Mechanismfor Peer-to-Peer Networks. In: Proc. of11th International Conference onInformation and Knowledge Management. McLean, Virginia, USA,2002,300-307
[50] E. Cohen, S. Shenker. Replication Strategies in Unstructured Peer-to-PeerNetworks. In: Proc. of the Conference on Applications, technologies,architectures, and protocols for computer communications. New York: ACMPress,2002,32(4):177-190
[51]冯国富,张金城,顾庆等.一种基于覆盖网络拓扑的无结构主动复制策略.软件学报,2007,18(9):2226-2234
[52] Crespo, H. Garcia-Molina. Routing Indices for Peer-to-Peer Systems. In: Proc.of22nd International Conference on Distributed Computing Systems. Vienna,Austria,2002,23-32
[53] Kumar, A., Xu, J., Zegura, et al. Efficient and scalable query routing forunstructured peer-to-peer networks. In: Proc. of24th Annual Joint Conferenceof the IEEE Computer and Communications Societies. Miami, USA,2005,1162-1173
[54] Shiping Chen, Zhan Zhang, Shigang Chen, et al. Efficient file search innon-DHT P2P networks. Computer Communications,2008,31(2):304-317
[55] Utku Günay Acer, Shivkumar Kalyanaraman, Alhussein A. Abouzeid. Weakstate routing for large-scale dynamic networks. IEEE/ACM Transactions onNetworking,2010,18(5):1450-1463
[56] Christoph Schmitz. Self-organization of a Small World by Topic. In: Proc. of1st International Workshop on Peer-to-Peer Knowledge Management. Boston,MA, USA,2004,303-310
[57]周晋,路海明,李衍达.用Small-World设计无组织P2P系统的路由算法.软件学报,2004,15(6):915-923
[58]汤大权,贺明科,孟庆崧.基于幂律分布和小世界特性的无结构P2P网络中搜索方法研究.计算机研究与发展,2007,44(9):1566-1571
[59] K. Sripanidkulchai, B. Maggs, H. Zhang. Efficient Content Location UsingInterest-Based Locality in Peer-to-Peer Systems. In: Proc. of22nd Annual JointConference on the IEEE Computer and Communications Societies. SanFrancisco, CA, USA,2003,2166-2176
[60] D. Zeinalipour-Yazti, V. Kalogeraki, D. Gunopulos. Exploiting locality forscalable information retrieval in peer-to-peer networks. Information Systems,2005,30(4):277–298
[61]曹迎春,王义麟,陈建忠等.一种基于语义相似的P2P搜索机制.计算机科学,2007,34(5):52-56
[62] Benjamin Arai, Gautam Das, Dimitrios Gunopulos, et al. Efficient ApproximateQuery Processing in Peer-to-Peer Networks. IEEE Transactions on Knowledgeand Data Engineering,2007,19(7):919-933
[63] Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghavan. SETS: SearchEnhanced by Topic Segmentation. In: Proc. of the26th Annual InternationalACM SIGIR Conference on Research and Development in InformationRetrieval. Toronto, Canada,2003,305-313
[64]钱宁,吴国新,赵生慧.基于贝叶斯网络的无结构化P2P资源搜索方法.计算机研究与发展,2009,46(6):889-897
[65] Rongmei Zhang, Y.Charlie Hu. Assisted Peer-to-Peer Search with PartialIndexing. IEEE Transactions on Parallel and Distributed Systems,2007,18(8):1146-1158
[66]冯国富,毛莺池,陆桑璐等. PeerRank:一种无结构P2P资源发现策.软件学报,2006,17(5):10981106
[67] Yingwu Zhu, Yiming Hu. Enhancing Search Performance on Gnutella-Like P2PSystems. IEEE Transactions on Parallel and Distributed Systems,2006,17(12):1482-1495
[68] Ishak, Iskandar, Salim, et al. Query routing using query feedback and similarityin unstructured peer to peer networks. International Journal of ComputerScience and Network Security,2008,8(8):24-29
[69] Lodi S., Mandreoli F., Martoglia R., et al. Semantic Peer, Here are theNeighbors You Want! In: Proc. of the11thInternational Conference onExtending Database Technology. Nantes, France,2008,26-37
[70]杨舰,吕智慧,钟亦平等.一种基于兴趣域的高效对等网络搜索方案.计算机研究与发展,2005,42(5):804～809
[71] Loo A. the Future or Peer-to-Peer Computing. Communications of the ACM,2003,46(9):51-61
[72] Yang B., H. Garcia-Molina. Comparing Hybrid Peer-to-Peer Systems. In: Proc.of27thInternational Conference on Very Large Data Bases. Rome, Italy,2001,54-63
[73] Loser, W.Nejdl, M.Wolpers, et al. Information Integration in Schema-BasedPeer-To-Peer Networks. In: Proc. of the15th Conference on AdvancedInformation Systems Engineering. Klagenfurt/Velden, Austria,2003,258-272
[74] P. Druschel, A. Rowstron. PAST: A Large-Scale Persistent Peer-to-Peer StorageUtility. In: Proc. of8th Workshop on Hot Topics in Operating Systems. SchlossElmau, Germany,2001,48-53
[75] Oceanstore project homepage. http://oceanstore.cs.berkeley.edu/,2006-7-5
[76] F. Dabek, M. F. Kaashoek, D. Karger, et al. Wide-area cooperative storage withcfs. In: Proc. of the18th ACM symposium on Operating systems principles.Banff, Canada,2001,202-215
[77] Feng Z, Li Z, Ben Y, et al. Approximate object location and spam filtering onpeer-to-peer systems. In: Proc. of the ACM/IFIP/USENIX2003InternationalConference on Middleware. Rio de Janeiro, Brazil,2003,1-20
[78] Reynolds P, Vahdat A. Efficient peer-to-peer keyword searching. In: Proc. ofthe ACM/IFIP/USENIX2003International Conference on Middleware. Rio deJaneiro, Brazil,2003,21-40
[79] BHARAMBE A R, AGRAWAL M, SESHAN S. Mercury: supporting scalablemulti-attribute range queries. In: Proc. of the ACM SIGCOMM2004Conference on Applications, Technologies, Architectures, and Protocols forComputer Communication. Portland, Oregon, USA,2004,353-366
[80]宋建涛,沙朝锋,杨智应等.语义对等网构造及搜索机制研究.计算机研究与发展,2004,41(4):645-652
[81]傅向华,冯博琴.一种支持复杂查询的有组织P2P搜索方法.小型微型计算机系统,2006,27(3):401-406
[82] Podnar I., Rajman M., Luu F., et al. Scalable Peer-to-Peer Web Retrieval withHighly Discriminative Keys. In: Proc. of IEEE23rd International Conference onData Engineering. Istanbul,2007,1096-1105
[83] Cristina Schmidt, Manish Parashar. Squid: Enabling search in DHT-basedsystems. Journal of Parallel and Distributed Computing,2008,68(7):962-975
[84]赵秀梅,刘方爱.支持串模糊匹配的Chord扩展资源索引模型.计算机应用研究,2009,26(12):4648-4651,4655
[85] Crespo,H. Garcia-Molina. Semantic Overlay Networks for P2P Systems. In:Proc. of the Third International Workshop on Agents and Peer-to-PeerComputing. New York, USA,2004,1-13
[86] Strassner J.. A Hierarchical Semantic Overlay System for Semantic Search andService Matchmaking. In: Proc. of the Fourth International Conference on NextGeneration Mobile Applications, Services and Technologies. Amman, Jordan2010,42-47
[87] Xia Zhanguo, Xia Shixiong, Wang Zhixiao, et al. A Field-Based Semantic P2POverlay Network. In: Proc. of4th International Conference on WirelessCommunications, Networking and Mobile Computing. Dalian, China,2008,1-4
[88] Gopalan, K.S. Improved search latency in peer to peer networks with contentlinks. In: Proc. of2009IEEE International Conference on Internet MultimediaServices Architecture and Applications. Bangalore,2009,1-6
[89] Liu Jie, Zhuge Hai. A semantic-based P2P resource organization modelR-Chord. Journal of systems and software,2006,79(11):1619-1631
[90]刘业,杨鹏.基于自组织聚类的结构化P2P语义路由改进算法.软件学报,2006,17(2):339-348
[91] Doulkeridis, K. N rv°ag, M. Vazirgiannis. DESENT: Decentralized andDistributed Semantic Overlay Generation in P2P Networks. IEEE Journal onSelected Areas in Communications,2007,25(1):25-34
[92] Baiyou Qiao, Guoren Wang, Kexin Xie. A Taxonomy-Based Approach forConstructing Semantics-Based Super-Peer Networks. In: Proc. of The JointAsia-Pacific Web Conference and Web-Age Information Management.Huanshan, China,2007,122-134
[93] T. Suel, C. Mathur, J. Wu, et al. Odissea: A peer-to-peer architecture forscalable web search and information retrieval. In: Proc. of the InternationalWorkshop on the Web and Databases. San Diego, California,2003,67-73
[94]何盈捷,王栅,杜小勇.纯Peer to Peer环境下有效的top-k查询.软件学报,2005,16(4):540-552
[95] W.-T. Balke, W. Nejdl, W. Siberski, et al. Progressive Distributed Top-kRetrieval in Peer-to-Peer Networks. In: Proc. of the21th InternationalConference on Data Engineering. Tokyo, Japan,2005,174-185
[96] Chernov S, Serdyukov P, Bender M, et al. Database selection and resultmerging in P2P web search. In: Proc. of the international conference onDatabases, information systems, and peer-to-peer computing Trondheim.Norway, Berlin,2007,26-37
[97]凌波,周永康,周傲英. P2P信息检索系统的查询结果排序与合并策略.计算机学报,2007,30(3):405-414
[98] Akrivi Vlachou, Christos Doulkeridis, Kjetil N rv g, et al. On Efficient Top-kQuery Processing in Highly Distributed Environments. In: Proc. of theinternational conference on Management of data. BC, Canada,2008,753-764
[99] Zhitao Guan, Guangwei Yan, Heqing Huang. A Novel Top-k Query Scheme inUnstructured P2P Networks. In: Proc. of Ninth IEEE International Conferenceon Computer and Information Technology. Xiamen, China,2009,16-21
[100] S.Airiau, S.Sen, P.Dasgupta. Effect of Joining Decisions on Peer Clusters. In:Proc. of the fifth International Joint Conference on Autonomous Agents andMultiagent System. Hakodate, Hokkaido, Japan,2006,609-615
[101] Loser, F.Naumann, W.Siberski, et al. Semantic Overlay Clusters withinSuper-Peer Netwoks. In: Proc. of International1th workshop on database,Information Systems and Peer-to-Peer Computing. Berlin, Germany,2003,33-47
[102] Seungwon Shin, Jaeyeon Jung, Hari Balakrishnan. Malware prevalence in theKaZaA file-sharing network. In: Proc. of the6th ACM SIGCOMM conferenceon Internet measurement. Rio de Janeriro, Brazil,2006,333-338
[103] W. Liu, J. Yu, J. Song, et al. ERASP: An Efficient and Robust Adaptive Superpeer Overlay Network. In: Proc. of the10th Asia Pacific Web Conference.Shenyang, China,2008,468-474
[104] Garbacki P., Dick H. J. E., Van Steen M.. The Design and Evaluation of aSelf-Organizing Superpeer Network. IEEE TRANSACTIONS ON COMPU-TERS,2010,59(3):317-331
[105] M. Liu, J. Zhou, T. Koskela. A Robust Algorithm for the MembershipManagement of Super-Peer Overlay. In: Proc. of the12th IFIP/IEEEInternational Conference on Management of Multimedia and Mobile Networksand Services: Wired-Wireless Multimedia Networks and Services Management.Venice, Italy,2009,132-143
[106] V. Lo, D. Y, C. G, et al. Scalable Supernode Selection in Peer-to-Peer OverlayNetworks. In: Proc. of the2005Second International Workshop on Hot Topicsin Peer-to-Peer Systems. OR, USA,2005,18-25
[107] Su-Hong Min, Joanne Holliday, Dong-Sub Cho. Optimal Super-peer Selectionfor Large-scale P2P System. In: Proc. of2006International Conference onHybrid Information Technology. Jeju Island, Korea,2006,588-593
[108] Suhong Min, Dongsub Cho. Super-Peer Selection Based Framework UsingDynamic Capacity and Similarity. In: Proc. of the21st International Symposiumon Computer and Information Sciences. Istanbul, Turkey,2006,803–812
[109] Montresor. A robust protocol for building super peer overlay topologies. In:Proc. of the4th International Conference on Peer-to-Peer Computing. Tokyo,Japan,2004,202-209
[110]郑倩冰,彭伟,卢锡城. ERSN:一种高效鲁棒的超节点对等网络.计算机研究与发展,2006,43(4):607-612
[111] Jenn-Wei Lin, Ming-Feng Yang. Robust Super-Peer-Based P2P File-SharingSystems. The Computer Journal,2010,53(7):951-968
[112]王继成,潘金贵,张福炎. Web文本挖掘技术研究.计算机研究与发展,2000,37(5):513-520
[113] R.O. Duda a, P.E. Hart. Pattern Classification and Scene Analysis. New York:John Wiley and Sons.1973,1-304
[114] Duda,R.O..模式分类.李宏东.第2版.北京:机械工业出版社,2003.9,1-140
[115] Zrhuts EW, Calvert KL, Bhattacharjee S. How to model an internetwork. In:Proc.of the Fifteenth Annual Joint Conference of the IEEE Computer Societies.Networking the Next Generation. San Francisco, USA,1996,594-602
[116] Buckley C. Implementation of the SMART information retrieval system.http://hdl.handle.net/1813/6526,2005-05-10
[117] R.Hayek, G.Raschia, P.Valduriez, et al. Summary Management in P2P Systems.In: Proc. of the11th international conference on Extending database technology:Advances in database technology. Nantes, France,2008,16-25
[118] Jiadi Yu, Minglu Li. CBT: A Proximity-Aware Peer Clustering System inLarge-Scale BitTorrent-like Peer-to-peer Networks. Computer Communi-cations,2008,31(3):591-602
[119] Christos Doulkeridis, Akrivi Vlachou, Kjetil N rv g, et al. Efficient SearchBased on Content Similarity over Self-Organizing P2P Networks. Peer-to-PeerNetworking and Applications,2010,3(1):67-79
[120] Paraskevi Raftopoulou, Euripides G., Christos Tryfonopoulos. RewiringStrategies for Semantic Overlay Networks. Distributed and Parallel Databases,2009,26(2-3):181-205
[121] K. Hammouda, M. Kamel. Collaborative Document Clustering. In: Proc. of theSixth SIAM International Conference on Data Mining. Bethesda, MD,2006,453–463
[122] Yanjun Li, Soon M. Chung, John D. Holt. Text Document Clustering Based onFrequent Word Meaning Sequences. Data&Knowledge Engineering,2008,64(1):381-404
[123] HaiJin, hanhua Chen. SermeX: Efficient Search in a Semantic Overlay forLiterature Retrieval. Future Generation Computer System,2008,24(6):475-488
[124] Habib Rostami, JafarHabibib, Emad Livani. Semantic Partitioning ofPeer-to-Peer Search Space. Computer Communications,2009,32(4):619-633
[125] Stephen J., H. Yang, Jia Zhang, et al. Improving Peer-to-Peer SearchPerformance through Intelligent Social Search. Expert Systems withApplications,2009,36(7):10312-10324
[126] P. Garbacki, D. H. J. Epema, M. van Steen. Optimizing Peer Relationships in aSuper-Peer Network. In: Proc. of27th IEEE International Conference onDistributed Computing Systems. Toronto, ON,2007,31-40
[127] Chawathe Y, Ratanasamy S, Breslau L, et al. Making gnutella-like P2P systemsscalable In: Proc. of the2003conference on Applications, technologies,architectures, and protocols for computer communications. Karlsruhe,Germany,2003,407-418
[128] LIN Tsunghan, HO Tsunghsuan, CHAN Yuwei, et al. M-Ring: A Distributed,Self-Organized, Load-Balanced Communication Method on Super Peer NetworkIn: Proc. of the International Symposium on Parallel Architectures, Algorithms,and Networks. Sydney, NSW,2008,59-64
[129] LI Jung-Shian, CHAO Chih-Hung. An Efficient Superpeer OverlayConstruction and Broadcasting Scheme Based on Perfect Difference Graph.IEEE Transactions on Parallel and Distributed Systems,2010,21(5):594-606
[130] Carlo Mastroianni, Pasquale Cozza, Domenico Talia, et al. A ScalableSuper-Peer Approach for Public Scientific Computation. Future GenerationComputer Systems,2009,25(3):213-223
[131] Yu Ge, Ting Yan. Similarity-Based Semantics Searching in Super-Peer NetworkModel. In: Proc. of International Conference on Internet Technology andApplications. Wuhan, China,2010,1-4
[132] Pyun Y J, Revevs D. S. Constructing a Balanced,(log(N)/loglog(N))-DiameterSuper-Peer Topology for Scalable P2P Systems. In: Proc. of FourthInternational Conference on Peer-to-Peer Computing. Zurich, switzer-land,2004,210-218
[133] HAN Hongmu, HE Jie, ZUO Cuihua. A hybrid P2P overlay network for highefficient search. In: Proc. of2nd IEEE International Conference on Informationand Financial Engineering. Chongqing, China,2010,241-245
[134]梁活民,肖文俊.一种具有小世界网络特征的常数度结构化覆盖网络.计算机学报,2010,33(9):1541-1547
[135] Mario Schlosser, Michael Sintek, Stefan Decker, et al.. HyperCuP-Hypercubes,Ontologies, and Efficient Search on Peer-to-Peer Networks. In: Proc. of FirstInternational Workshop on Agents and peer to peer computing. Bologna, Italy,2002,112-124
[136] PARHAMI B, RAKOV M A. Performance, Alogorithmic, and RobustnessAttributes of Perfect Difference Networks. IEEE Transactions On Parallel andDistributed Systems,2005,16(8):725-736
[137]刘方爱,乔香珍,刘志勇.一种实用的互联网络拓扑结构RP(k)及路由算法.中国科学E辑,2002,32(3):380-385
[138] CALVERT K, EAGAN J, MERUGU S, et al. Extending and EnhancingGT-ITM. In: Proc. of the ACM SIGCOMM workshop on Models, methods andtools for reproducible network research. Karlsruhe, Germany,2003,23-27
[139] Tang Chun-Qiang, Xu Zhi-Chen. pSearch: Information retrieval in structuredoverlays. Computer Communication Review,2003,33(1):89-94
[140] N.Fuhr. A decision-theoretic approach to database selection in networked IR.ACM Transactions on Information Systems,1999,17(3):229-249
[141] Z.Nie, S.Kambhampati, T.Hernandez. Statminer:Effectively mining and usingcoverage and overlap statistics in data integration. In: Proc. the InternationalConference on Very Large Data Bases. Berlin, Germany,2003,1097-1100
[142] Y.Zhang, J.Callan, T.Minka. Novelty and redundancy detection in adaptivefiltering. In: Proc. of the International Conference on Management of data. BC,Canada,2002,81-88
[143] N. Fuhr. A decision-theoretic approach to database selection in networked IR.ACM Transactions on Information Systems,1999,17(3):229-249
[144] Ng W.S, Ooi B.C, Tan K.L. BestPeer: A self-configurable Peer-to-Peer system.In: Proc. of the18th International Confernece on Data Engineering. San Jose,CA, USA,2002,272-276