基于小世界模型的P2P网络文本检索
|
摘要
与集中式搜索引擎相比,构建在P2P网络上的文本检索系统在可扩展性、数据更新、维护成本和安全性等方面具有与生俱来的优势。由于P2P网络中的节点缺乏全局网络的拓扑知识,如何定位节点资源、减少网络节点之间的通信开销成为P2P网络中文本检索的核心问题。本文基于小世界模型研究了P2P网络中的文本检索问题,主要贡献如下:
针对向量空间模型中文档矩阵高维稀疏的问题,提出了一个P2P网络节点文档向量降维的方法。该方法将文档中词频出现两次以上的词条作为文档的摘要信息,来表示节点文档内容,然后根据改进的STC算法为选出的词条建立了一个树状的层次结构。在计算文档向量相似度时,采用sigmoid函数为不同层次的词条赋予不同的权重。
针对Gnutella网络中转发消息的泛洪问题,基于小世界模型提出了一种无结构P2P网络文本检索的方法。该方法中,P2P网络的每个节点都维护一定数量的短程连接邻居节点和长程连接邻居节点,由此来构建具有小世界特性的网络。邻居节点的更新策略是在节点的查询和应答交互过程中进行的,每次查询结束后,都会更新邻居节点文档向量中关键词的权重,使得节点能够动态地快速了解网络的拓扑情况和其他节点的文档内容。实验结果显示,与Gnutella网络相比,小世界P2P网络具有更大的聚类系数、较小的特征路径长度和更高的文本检索查全率。
针对基于DHT技术的结构化P2P网络在不支持复杂查询、负载不平衡和路由效率低等方面的问题,根据Kleinberg小世界模型设计了一个结构化P2P网络协议(SPPSW协议)。在SPPSW协议中,内容相近的节点被划分到相同的节点类中,在节点类的内部,节点可以根据相似程度选择邻居,网络由一些相互连接节点类构成。节点类可以动态地调整节点类的大小,能够自组织地分裂、合并,节点类之间存在一些长程连接,缩短了查询路由步数。实验结果显示,随着网络规模的扩大,在SPPSW协议网络中,搜索开销呈对数平方曲线增长,维护开销呈线性增长;选择一个合适的节点类内部节点的数量,可以使得整体的网络维护开销和搜索开销最小。
Comparing to the centralized search engine, text retrieval systems built on top of P2P networks have innate superiority in scalability, data update, maintenance cost, safety, and so forth. Due to lack of globe knowledge of networks topology, how to locate data in P2P networks and reduce communication overhead become the major issues in text retrieval under the P2P environment. In this paper, problems of text retrieval in P2P networks are studied based on the small world model and the main contributions are as follows.
For the problem of high-dimensional, sparse documentation matrix, this paper presents a dimension reduction method to documents in nodes of P2P networks. In this method, words which appear more than twice are picked up to represent the content of the nodes, and then improved STC algorithm is employed to build a hierarchical structure with the selected words. In the calculation of document vector similarity, words at different levels in the hierarchical structure are given different weights with the sigmoid function.
For the flooding problem in Gnutella, a text retrieval method is proposed in unstructured P2P networks based on small world models. Each node in the P2P networks maintains several long-link neighbours and short-link neighbours to build a small world P2P networks. Neighbour update is processed during the query and response. And after each query, weights of the words in documents of neighbour nodes will be revised. This makes it rapidly to find out the networks topology and contents of other nodes. Experiment results show that small world P2P networks yields higher recall in comparison with Gnutella and takes on the characteristics of small world with greater clustering coefficient and lower average path length.
For the problems of complex queries, load balance and routing efficiency in structured P2P networks based on DHT, a protocol in structured P2P networks called SPPSW is designed with Kleinberg small world model. In SPPSW, nodes are clustered with the similarity of nodes contents. Nodes in the same cluster can select neighbours according to the similarity, and finally the network is made up of linked cluster. Node clusters could adjust its size by dividing into smaller one or merging into larger one. With SPPSW, routing path length is shortened by the long-link between node clusters. Experiment results show that search cost is increased with the curve of the square of logarithm and maintenance cost is linearly increased as the scale of networks goes up. And also the maintenance cost and search cost will be minimized with proper cluster size.
针对向量空间模型中文档矩阵高维稀疏的问题,提出了一个P2P网络节点文档向量降维的方法。该方法将文档中词频出现两次以上的词条作为文档的摘要信息,来表示节点文档内容,然后根据改进的STC算法为选出的词条建立了一个树状的层次结构。在计算文档向量相似度时,采用sigmoid函数为不同层次的词条赋予不同的权重。
针对Gnutella网络中转发消息的泛洪问题,基于小世界模型提出了一种无结构P2P网络文本检索的方法。该方法中,P2P网络的每个节点都维护一定数量的短程连接邻居节点和长程连接邻居节点,由此来构建具有小世界特性的网络。邻居节点的更新策略是在节点的查询和应答交互过程中进行的,每次查询结束后,都会更新邻居节点文档向量中关键词的权重,使得节点能够动态地快速了解网络的拓扑情况和其他节点的文档内容。实验结果显示,与Gnutella网络相比,小世界P2P网络具有更大的聚类系数、较小的特征路径长度和更高的文本检索查全率。
针对基于DHT技术的结构化P2P网络在不支持复杂查询、负载不平衡和路由效率低等方面的问题,根据Kleinberg小世界模型设计了一个结构化P2P网络协议(SPPSW协议)。在SPPSW协议中,内容相近的节点被划分到相同的节点类中,在节点类的内部,节点可以根据相似程度选择邻居,网络由一些相互连接节点类构成。节点类可以动态地调整节点类的大小,能够自组织地分裂、合并,节点类之间存在一些长程连接,缩短了查询路由步数。实验结果显示,随着网络规模的扩大,在SPPSW协议网络中,搜索开销呈对数平方曲线增长,维护开销呈线性增长;选择一个合适的节点类内部节点的数量,可以使得整体的网络维护开销和搜索开销最小。
Comparing to the centralized search engine, text retrieval systems built on top of P2P networks have innate superiority in scalability, data update, maintenance cost, safety, and so forth. Due to lack of globe knowledge of networks topology, how to locate data in P2P networks and reduce communication overhead become the major issues in text retrieval under the P2P environment. In this paper, problems of text retrieval in P2P networks are studied based on the small world model and the main contributions are as follows.
For the problem of high-dimensional, sparse documentation matrix, this paper presents a dimension reduction method to documents in nodes of P2P networks. In this method, words which appear more than twice are picked up to represent the content of the nodes, and then improved STC algorithm is employed to build a hierarchical structure with the selected words. In the calculation of document vector similarity, words at different levels in the hierarchical structure are given different weights with the sigmoid function.
For the flooding problem in Gnutella, a text retrieval method is proposed in unstructured P2P networks based on small world models. Each node in the P2P networks maintains several long-link neighbours and short-link neighbours to build a small world P2P networks. Neighbour update is processed during the query and response. And after each query, weights of the words in documents of neighbour nodes will be revised. This makes it rapidly to find out the networks topology and contents of other nodes. Experiment results show that small world P2P networks yields higher recall in comparison with Gnutella and takes on the characteristics of small world with greater clustering coefficient and lower average path length.
For the problems of complex queries, load balance and routing efficiency in structured P2P networks based on DHT, a protocol in structured P2P networks called SPPSW is designed with Kleinberg small world model. In SPPSW, nodes are clustered with the similarity of nodes contents. Nodes in the same cluster can select neighbours according to the similarity, and finally the network is made up of linked cluster. Node clusters could adjust its size by dividing into smaller one or merging into larger one. With SPPSW, routing path length is shortened by the long-link between node clusters. Experiment results show that search cost is increased with the curve of the square of logarithm and maintenance cost is linearly increased as the scale of networks goes up. And also the maintenance cost and search cost will be minimized with proper cluster size.
引文
[1]C.D.Prete, J.T.McArthur, R.L.Villars et al.Industry developments and models, Disruptive Innovation in Enterprise Computing: storage. In: IDC, 2003
[2]Netcraft Ltd.Web Server Survey.2007, http://news.netcraft.com/archives/web_server_survey.html
[3]P.Lyman, H.R.Varian, K.Swearingen et al.How much information?,School of Information Management and Systems University of California at Berkeley. http://www.sims.berkeley.edu/how-much-info, 2000
[4]P.Lyman, H.R.Varian, K.Swearingen et al.How much information 2003?,School of Information Management and Systems University of California at Berkeley. http://www.sims.berkeley.edu/how-much-info-2003, 2003
[5]S.Brin, L.Page.The anatomy of a large-scale hypertextual Web search engine.In: Proceedings of 7th International World Wide Web Conference. Brisbane, Australia, 1998, 107~117
[6]J.Cho.Crawling the Web: Discovery and maintenance of large-scale Web data. PhD Dissertation, Stanford University, California, 2002
[7]K.Gummadi, R.Gummadi, S.Gribble et al.The impact of DHT routing geometry on resilience and proximity.In: Proceedings of ACM SIGCOMM, ACM Press, New York, USA, 2003, 381~394
[8]罗杰文, Peer to Peer (P2P)综述, http://www.intsci.ac.cn/users/luojw/papers/p2p.htm, 2005
[9]Napster.http://www.napster.com
[10]KaZaA.http://www.kazaa.com
[11]Gnutella.http://gnutella.wego.com
[12]Limewire.http://www.limewire.com
[13]Morpheus.http://www.musiccity.com
[14]B.Cohen.BitTorrent http://bitconjurer.org/BitTorrent/index.html, 2001
[15]eMule.http://www.emule.com/
[16]LumaQQ.http://lumaqq.linuxsir.org/main/
[17]J.Kubiatowicz, W.Weimer, C.Wells et al.OceanStore: an architecture for global-scale persistent storage. In:ACM SIGPLAN Notices,ACM Press, New York,USA., 2000, 35(11):190~201
[18]D.S.Milojicic, V.Kalogeraki, R.Lukose et al.Peer-to-peer computing, Tech Report: HPL-2002-57, http://www.hpl.hp.com/techreports/2002/HPL-2002-57.pdf,2002
[19]Peer-to-peer Work Group.http://www.p2pwg.org, 2001
[20]R.L.GRAHAM.Traditional and Non-Traditional Application Http://www.ida.liu.se/~TDTS43/tdts43-10-peer-topeer.pdf, 2001
[21]C.SHIRKY.What is P2P... and what Isn’t Http://www.openp2p.com/lpt/a//p2p/2000/11/24/shirky1-whatisp2p.html, 2001
[22]S.Androutsellis-Theotokis, D.Spinellis.A survey of peer-to-peer content distribution technologies. ACM Computing Surveys, ACM Press New York, USA, 2004, 335~371
[23]I.Clarke, O.Sandberg, B.Wiley et al.Freenet: A distributed anonymous information storage and retrieval system.In: Proceeds of International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability.Berkeley, California, USA, 2001, 46~66
[24]I.Stoica, R.Morris, D.Karger et al.Chord: A scalable peer-to-peer lookup service for internet applications.In: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications. San Diego, California, USA, 2001, 149~160
[25]S.Ratnasamy, P.Francis, M.Handley.A scalable content-addressable network.In:Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications,San Diego, California, USA,2001,161~172
[26]A.Rowstron, P.Druschel.Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems.In: Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms, Heidelberg, Germany, 2001, 329~350
[27]B.Y.Zhao, J.Kubiatowicz, A.D.Joseph.Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing.IEEE Journal on Selected Areas in Communications, Jan.2004, 22(1):41~53
[28]A.Crespo, H.G.Molina.Routing indices for peer-to-peer systems.In:Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems (ICDCS), 2002, 23~32
[29]Fast Track,http://www.fasttrack.nu/
[30]C.H.Ng, K.C.Sia.Peer clustering and firework query model. In: Poster of the 11th International World Wide Web Conference (WWW), Honolulu, Hawaii, USA, 2002
[31]M.Bawa, G.Manku,P.Raghavan.Sets: Search enhanced by topic segmentation.In:Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval,Toronto, Canada, 2003,306~313
[32]E.Cohen, H.Kaplan, A.Fiat.Associative search in peer to peer networks: Harnessing latent semantics.In:Proceedings of INFOCOM 2003,22nd Annual Joint Conference of the IEEE Computer and Communications Societies, 2003, 2:1261~1271
[33]K.Spripanidkulchai, B.Maggs, H.Zhang.Efficient content location using interest-based locality in peer-to-peer systems,In:Proceedings of INFOCOM 2003, 22nd Annual Joint Conference of the IEEE Computer and Communications Societies,2003,3:2166~2176
[34]Y.W. Zhu, Y.M. Hu.Ess: Efficient semantic search on gnutella-like p2p system.Technical report, Department of ECECS, University of Cincinnati, 2004
[35]A.Crespo, H.Garcia-Molina.Semantic Overlay Networks for P2P Systems. Technical report, Stanford University, 2001
[36]A.Crespo, H.Garcia-Molina.Semantic overlay networks. Technical report, Stanford University, 2002
[37]A. Loser, F. Naumann, W. Siberski et al.Semantic overlay clusters within super-peer networks.In:Proceedings of the International Workshop on Databases, Information Systems and Peer-to-Peer Computing (P2PDBIS), LNCS, 2004,2944:33~47
[38]X.Liu , J.Wang, S.T.Vuong.A Category Overlay Infrastructure for Peer-to-Peer Content Search.In:Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05),2005,9:204a
[39]C. Doulkeridis, K. N?rvag, M. Vazirgiannis.DESENT: decentralized and distributed semantic overlay generation in P2P networks.IEEE Journal on Selected Areas in Communications, Jan.2007, 25(1):25~34
[40]C. Doulkeridis, K. N?rvag, M. Vazirgiannis.The SOWES approach to P2P web search using semantic overlays.In: Proceedings of the 15th international conference on World Wide Web(WWW),2006,1027~1028
[41]H.Jin, X.Ning, H.Chen et al.Efficient query routing for information retrieval in semantic overlays.In:Proceedings of the 2006 ACM symposium on applied computing,2006,1669~1673
[42]S.Voulgaris, A.M.Kermarrec, L.Massoulie.Exploiting semantic proximity in peer-to-peer content searching.In: Proceedings of 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, May 2004, 238~243
[43]J.X.Parreira, S.Michel, G.Weikum.p2pDating: Real life inspired semantic overlay networks for Web search.Information Processing and Management, May 2007, 43(3):643~664
[44]A.R.Bharambe, M.Agrawal, S.Seshan.Mercury: supporting scalable multi-attribute range queries.In: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications, 2004, 353~366
[45]M.Bender, S.Michel, P.Triantafillou et al.MINERVA: collaborative P2P search.In: Proceedings of the 31st international conference on Very large data bases, 2005, 1263~1266
[46]C. Tang, Z. Xu, S. Dwarkadas.Peer-to-peer information retrieval using self-organizing semantic overlay networks.In:Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications, Karlsruhe, Germany, 2003, 175~186
[47]M.Schlosser, M.Sintek, S.Decker.HyperCuP-Hypercubes.Ontologies and Efficient Search on P2P Networks.In: Proceedings of Workshop on Agents and P2P Computing, LNCS, 2002, 2530:133~134
[48]T.Luu, F.Klemm, I.Podnar et al.ALVIS peers: a scalable full-text peer-to-peer retrieval engine.In: Proceedings of the international workshop on Information retrieval in peer-to-peer networks, 2006, 41~48
[49]O.D.Sahin, F.Emekci, D.Agrawal et al.Content-Based Similarity Search over Peer-to-Peer Systems.In: Proceedings of the International Workshop on Databases, Information Systems, and Peer-to-Peer Computing, LNCS, 2004,3367:61~78
[50]C.Tang, Z.Xu, M.Mahalingam.Peersearch: Efficient information retrieval in peer-to-peer networks.In: Proceedings of HotNets-I, ACM SIGCOMM, 2002
[51]H.T.Shen, Y.Shu, B.Yu.Efficient semantic-based content search in P2P network.IEEE Transactions on Knowledge and Data Engineering, July 2004, 16(7):813~826
[52]J.Broekstra, M.Ehrig, P.Haase et al.A metadata model for semantics-based peer-to-peer systems.In: Proceedings of the WWW’03 Workshop on Semantics in Peer-to-Peer and Grid Computing, 2003
[53]W.Nejdl, B.Wolf, C.Qu et al.EDUTELLA: a P2P networking infrastructure based on RDF.In:Proceedings of the 11th international conference on World Wide Web, Honolulu, Hawaii, USA , 2002, 604~615
[54]S.Castano, S.Ferrara, S.Montanelli et al.Ontology-addressable contents in p2p networks.In:Proceedings of the WWW’03 Workshop on Semantics in Peer-to-Peer and Grid Computing, 2003
[55]H.Xiao and I.F.Cruz.Ontology-based query rewriting in peer-to-peer networks.In:Proceedings of the 2nd International Conference on Knowledge Engineering and Decision Support, 2006,11~18
[56]M.Cai and M.Frank.RDFpeers: A scalable distributed RDF repository based on a structured peer-to-peer network.In:Proceedings of the 13th International World Wide Web Conference (WWW), 2004,17~22
[57]B.Ahlborn, W.Nejdl, and W.Siberski.OAI-P2P: A peer-to-peer network for open archives.In:Proceedings of International Conference on Parallel Processing Workshops (ICPPW02), 2002,462~468
[58]P.Haase, J.Broekstra, M.Ehrig et al.Bibster– A Semantics-Based Bibliographic Peer-to-Peer System.In: Proceedings of the 3nd International Semantic Web Conference, Japan, November 2004, 122~136
[59]R.Siebes.pNear: combining content clustering and distributed hash tables.In: Proceedings of the IEEE’05 Workshop on Peer-to-Peer Knowledge Management, 2005
[60]R.Siebes, S.Kotoulas.pRoute: Expertise-based selection using shared term similarity matrices.In:Proceedings of the 17th Belgian-Dutch Conference on Artificial Intelligence,2005,202~208
[61]H.Zhuge, J.Liu, L.Feng et al.Query routing in a peer-to-peer semantic link network.Computational Intelligence, 2005, 21(2):197~216
[62]M.Li, W.C.Lee, A.Sivasubramaniam et al.A small world overlay network for semantic based search in P2P systems.In: Proceedings of Workshop on Semantics in Peerto-Peer and Grid Computing (SemPGrid), in conjunction with the World Wide Web Conference (WWW), 2004
[63]M.Li, W.C.Lee, A.Sivasubramaniam et al.Semantic small world: an overlay network for peer-to-peer search.In: Proceedings of the 12th IEEE International Conference on Network Protocols, 2004, 228~238
[64]R.Akavipat, L.S.Wu, F.Menczer.Small World Peer Networks in Distributed Web Search.In:Proceedings of the 13th international World Wide Web conference on Alternate track papers and posters,2004,396~397
[65]L.S.Wu, R.Akavipat, F.Menczer.6S:Distributing crawling and searching across Web peers.In:Proceedings of the IASTED International Conference on Web technologies, Applications, and Services, Calgary, Canada,July 2005
[66]R.Akavipat, L.S.Wu, F.Menczer et al.Emerging semantic communities in peer web search.In:Proceedings of the international workshop on Information retrieval in peer-to-peer networks,Arlington,Virginia, USA,2006,1~8
[67]H.Jin,X.Ning, H.Chen.Efficient search for peer-to-peer information retrieval using semantic small world.In:Proceedings of the 15th international conference on World Wide Web,Edinburgh,Scotland,2006, 1003~1004
[68]H.Jin,X.Ning.Improving Search in Peer-to-Peer Literature Sharing Systems via Semantic Small World.In:Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing,2007, 31~38
[69]H.Zhang, A.Goel, R.Govindan.Using the small-world model to improve Freenet performance.Computer Networks: The International Journal of Computer and Telecommunications Networking, Elsevier North-Holland, Inc.2004, 46(4):555~574
[70]L.Liu, S.Mackin, N.Antonopoulos.Small World Architecture for Peer-to-Peer Networks.In: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology, 2006, 451~454
[71]周晋,路海明,李衍达,用Small-World设计无组织P2P系统的路由算法,软件学报,2004,15(6):915~923
[72]周晋,李衍达,基于Small-World网络的非结构化DHT算法,计算机研究与发展,2005,42(1):109~117
[73]邹福泰,基于分布式哈希表的对等系统关键技术研究:[博士学位论文],上海;上海交通大学,2004
[74]S.Milgram.The small world problem.Psychology Today, 1967,2:60~67
[75]J.Travers, S.Milgram.An experimental study of the small world problem.Sciometry, 1969, 32(4): 425~443
[76]R.Albert, H.Jeong, A.L.Barabasi.The diameter of the World Wide Web.Nature,1999,401(6749):130
[77]H.Kautz, B.Selman, M.Shah.ReferralWeb: Combining Social Networks and Collaborative Filtering.Communications of the ACM, March 1997, 40(3):63~65
[78]D.J.Watts, S.H.Strogatz.Collective Dynamics of Small-World Networks.Nature, 1998, 393:440~442
[79]J.Kleinberg.Navigation in a small world.Nature,2000,406:845
[80]J.Kleinberg.The small-world phenomenon:An algorithm perspective.In:Proceedings of the 32nd Annual ACM Symposium on Theory of Computing,2000,163~170
[81]J.Kleinberg.The small-world phenomenon and Decentralized Search.SIAM news,2004,37(3)
[82]P.Erdos, A.Renyi.On the evolution of random graphs.Publications of the Mathematical Institute of the Hungarian Academy of Sciences, 1960, 5:17~61
[83]P.Erdos, A.Renyi.On random graphs.Publicationes Mathematicae, 1959, 6:290~297
[84]M.E.J. Newman,D.J.Watts.Scaling and percolation in the small-world network model.Physical Review, 1999, E 60:7332~7342
[85]B.BollobAs.Random Graphs.Academic Press, 1985
[86]L.A.N. Amaral, A.Scala, M.Barthklkmy et al.Classes of small-world networks, In: Proceedings of the National Academy of Sciences,2000 ,11149~11152
[87]A.L.BarabAsi, R.Albert.Emergence of scaling in random networks, Science,1999,286:509~512
[88]D.J.Watts.Small Worlds: The Dynamics of Networks Between Order and Randornness.Princeton University Press, Princeton, New Jersey, 1999.
[89]A.Barrat, M.Weigt.On the properties of small-world network models The European Physical Journal B - Condensed Matter and Complex Systems,2000, 13(3):547~560
[90]M.E.J.Newman, D.J.Watts.Renormalization group analysis of the small-world network model.Physics Letters A, 1999, 263(4-6):341~346
[91]M.E.J.Newman, C.Moore, D.J.Watts.Mean-Field Solution of the Small-World Network Model.Physical Review Letter, 2000, 84(14):3201~3204
[92]M.E.J.Newman.The structure and function of networks.SIAM Review, 2002, 45(2):167~256
[93]R.Baeza-Yates, B.Ribeiro-Neto, Mordern Information Retrieval(王知津等译),北京:机械工业出版社,2005.
[94]S.E.Robertson, K.S.Jones.Relevance weighting of search terms.Journal of the American Society for Information Science, 1976, 27(3):129~146
[95]G.Salton, M.McGill.Introduction to Modern Information Retrieval.McGraw-Hill, NewYork, 1983
[96]C.Buckley, G.Salton, J. Allan et al.Automatic query expansion using SMART: TREC 3.In:Overview of the Third Text REtrieval Conference, National Institute of Standards and Technology Special Publication 500-226, NIST,Gaithersburg, MD, April 1995, 69~80
[97]M.Berry, Z.Drmac, E. Jessup.Matrices, Vector Spaces, and Information Retrieval.SIAM Review,1999,41(2):335~362
[98]M.W.Berry, S.T.Dumais, G.W.O'Brien.Using Linear Algebra for Intelligent Information Retrieval.SIAM Review, 1995, 37:573~595
[99]G.Salton, C.Buckley.Term-weighting approaches in automatic retrieval.Information Processing & Management, 1988, 24(5):513~523
[100]L.F.Chien.PAT-Tree-Based Keyword Extraction for Chinese Information Retrieval.In:Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval , Philadelphia, Pennsylvania, USA., 1997, 50~58
[101]T.H.Ong, H.Chen.Updateable PAT-Tree Approach to Chinese Key Phrase Extraction Using Mutual Information: A Linguistic Foundation for Knowledge Management.In: Proceedings of the Second Asian Digital Library Conference, Taipei, Taiwan, 1999
[102]O.Zamir, O.Etzioni.Web document clustering: a feasibility demonstration.In: Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, 1998, 46~54
[103]O.Zamir, O.Etzioni.Grouper: a dynamic clustering interface to Web search results. Computer Networks: The International Journal of Computer and Telecommunications Networking. 1999, 31(11-16): 1361~1374
[104]G.Karypis, E.H.Han, V.Kumar.Chameleon: hierarchical clustering using dynamic modeling.Computer, 1999, 32(8):68-75
[105]G.Karypis, V.Kumar.A fast and highly quality multilevel scheme for partitioning irregular graphs.SIAM Journal on Scientific Computing, 1999, 20(1):359~392
[106]G.Karypis, V.Kumar.Multilevel k-way hypergraph partitioning.In: Proceedings of the Design and Automation Conference, 1999, 243~348
[107]W.M.Shaw, R.Burgin, P.Howell.Performance standards and evaluations in IR test collections: Cluster-based retrieval models. Information Processing and Management, 1997, 33(1):1~14
[108]C.Schmitz.Self-organization of a Small World by Topic.In: Proceedings of First International Workshop on Peer-to-Peer Knowledge Management, Boston, MA, August 2004.
[109]L.Guo, S.Jiang, L.Xiao et al.Exploiting Content Localities for Efficient Search in P2P Systems.In:Proceedings of 18th International Symposium on Distributed Computing (DISC 2004), Amsterdam, Netherlands, LNCS, 2004, 3274:349~364
[110]A.Iamnitchi, M.Ripeanu, I.Foster.Small-World File-Sharing Communities.In:Proceedings of the 23rd AnnualJoint Conference of the IEEE Computer and Communications Societies, INFOCOM 2004,2:952~963
[111]A.Iamnitchi, M.Ripeanu, I.Foster.Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations.In: Proceedings of the First International Workshop on Peer-to-Peer Systems, LNCS, 2002, 2429:232~241
[112]L.A.Adamic.The Small World Web.In:Proceedings of the Third European Conference on Research and Advanced Technology for Digital Libraries, LNCS, 1999,1696:443~452
[113]M.Faloutsos, P.Faloutsos, C.Faloutsos.On power-law relationships of the Internet topology.In:Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication,1999, 251~262
[114]F.Zou, Y.Li, L.Zhang et al.A Novel Approach for Constructing Small World in Structured P2P Systems.In: Proceedings of Grid and Cooperative Computing (GCC), LNCS, 2004, 3251:807~810
[115]M.Jovanovic, F.S.Annexstein, K.A.Berman.Modeling peer-to-peer network topologies through small-world models and power laws.IX Telecommunications Forum TELFOR, 2001, 20~22
[116]S.Bordag,G.Heyer,U. Quasthoff.Small worlds of concepts and other principles of semantic search.In:Proceedings of Innovative Internet Computing Systems Second International Workshop (IICS),LNCS,2003,2877:10~19
[117]OMNeT. http://www.omnetpp.org/
[118]A.Z.Kronfol. FASD: A Fault-tolerant, Adaptive, Scalable, Distributed Search Engine. http://wortschatz.uni-leipzig.de/~fwitschel/vorlP2P/literatur/FASD.pdf,2002.
[119]Z.Xu, R.Min, Y.Hu.Reducing maintenance overhead in DHT based peer-to-peer algorithms.In: Proceedings of Third International Conference on Peer-to-Peer Computing, 2003, 218~219
[120]FreePastry. http://freepastry.org/FreePastry/tutorial/
[121]FIPS 180-1.Secure Hash Standard.USA Department of Commerce/NIST, National Technical Information Service, Springfield, VA, Apr. 1995.
[122]Oskar Sandberg.Searching in a Small World.[Doctor Dissertation], Goteborg University,Goteborg, Sweden, 2005,14~15
[123]A.B.Teslyuk, S.A.Krashakov, L.N.Shchur.On the universality of rank distributions of website popularity.Computer Networks, 2006,50(11): 1769~1780
[124]L.A.Adamic, B.A.Huberman.The Nature of Markets in the World Wide Web.Quarterly Journal of Electronic Commerce, 2000, 1(1):5~12
[125]S.C.Deerwester, S.T.Dumais, G.W.Furnas et al.Indexing by latent semantic analysis.Journal of the American Society for Information Science, 1990, 41(6):391~407
[126]M.W.Berry.Survey of Text Mining: Clustering, Classification, and Retrieval.Springer-Verlag, New York, 2004
[127]L.A.Adamic, R.M.Lukose, A.R.Puniyani et al.Search in power-law networks.Physical Review, 2001, E64:046135
[2]Netcraft Ltd.Web Server Survey.2007, http://news.netcraft.com/archives/web_server_survey.html
[3]P.Lyman, H.R.Varian, K.Swearingen et al.How much information?,School of Information Management and Systems University of California at Berkeley. http://www.sims.berkeley.edu/how-much-info, 2000
[4]P.Lyman, H.R.Varian, K.Swearingen et al.How much information 2003?,School of Information Management and Systems University of California at Berkeley. http://www.sims.berkeley.edu/how-much-info-2003, 2003
[5]S.Brin, L.Page.The anatomy of a large-scale hypertextual Web search engine.In: Proceedings of 7th International World Wide Web Conference. Brisbane, Australia, 1998, 107~117
[6]J.Cho.Crawling the Web: Discovery and maintenance of large-scale Web data. PhD Dissertation, Stanford University, California, 2002
[7]K.Gummadi, R.Gummadi, S.Gribble et al.The impact of DHT routing geometry on resilience and proximity.In: Proceedings of ACM SIGCOMM, ACM Press, New York, USA, 2003, 381~394
[8]罗杰文, Peer to Peer (P2P)综述, http://www.intsci.ac.cn/users/luojw/papers/p2p.htm, 2005
[9]Napster.http://www.napster.com
[10]KaZaA.http://www.kazaa.com
[11]Gnutella.http://gnutella.wego.com
[12]Limewire.http://www.limewire.com
[13]Morpheus.http://www.musiccity.com
[14]B.Cohen.BitTorrent http://bitconjurer.org/BitTorrent/index.html, 2001
[15]eMule.http://www.emule.com/
[16]LumaQQ.http://lumaqq.linuxsir.org/main/
[17]J.Kubiatowicz, W.Weimer, C.Wells et al.OceanStore: an architecture for global-scale persistent storage. In:ACM SIGPLAN Notices,ACM Press, New York,USA., 2000, 35(11):190~201
[18]D.S.Milojicic, V.Kalogeraki, R.Lukose et al.Peer-to-peer computing, Tech Report: HPL-2002-57, http://www.hpl.hp.com/techreports/2002/HPL-2002-57.pdf,2002
[19]Peer-to-peer Work Group.http://www.p2pwg.org, 2001
[20]R.L.GRAHAM.Traditional and Non-Traditional Application Http://www.ida.liu.se/~TDTS43/tdts43-10-peer-topeer.pdf, 2001
[21]C.SHIRKY.What is P2P... and what Isn’t Http://www.openp2p.com/lpt/a//p2p/2000/11/24/shirky1-whatisp2p.html, 2001
[22]S.Androutsellis-Theotokis, D.Spinellis.A survey of peer-to-peer content distribution technologies. ACM Computing Surveys, ACM Press New York, USA, 2004, 335~371
[23]I.Clarke, O.Sandberg, B.Wiley et al.Freenet: A distributed anonymous information storage and retrieval system.In: Proceeds of International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability.Berkeley, California, USA, 2001, 46~66
[24]I.Stoica, R.Morris, D.Karger et al.Chord: A scalable peer-to-peer lookup service for internet applications.In: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications. San Diego, California, USA, 2001, 149~160
[25]S.Ratnasamy, P.Francis, M.Handley.A scalable content-addressable network.In:Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications,San Diego, California, USA,2001,161~172
[26]A.Rowstron, P.Druschel.Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems.In: Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms, Heidelberg, Germany, 2001, 329~350
[27]B.Y.Zhao, J.Kubiatowicz, A.D.Joseph.Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing.IEEE Journal on Selected Areas in Communications, Jan.2004, 22(1):41~53
[28]A.Crespo, H.G.Molina.Routing indices for peer-to-peer systems.In:Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems (ICDCS), 2002, 23~32
[29]Fast Track,http://www.fasttrack.nu/
[30]C.H.Ng, K.C.Sia.Peer clustering and firework query model. In: Poster of the 11th International World Wide Web Conference (WWW), Honolulu, Hawaii, USA, 2002
[31]M.Bawa, G.Manku,P.Raghavan.Sets: Search enhanced by topic segmentation.In:Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval,Toronto, Canada, 2003,306~313
[32]E.Cohen, H.Kaplan, A.Fiat.Associative search in peer to peer networks: Harnessing latent semantics.In:Proceedings of INFOCOM 2003,22nd Annual Joint Conference of the IEEE Computer and Communications Societies, 2003, 2:1261~1271
[33]K.Spripanidkulchai, B.Maggs, H.Zhang.Efficient content location using interest-based locality in peer-to-peer systems,In:Proceedings of INFOCOM 2003, 22nd Annual Joint Conference of the IEEE Computer and Communications Societies,2003,3:2166~2176
[34]Y.W. Zhu, Y.M. Hu.Ess: Efficient semantic search on gnutella-like p2p system.Technical report, Department of ECECS, University of Cincinnati, 2004
[35]A.Crespo, H.Garcia-Molina.Semantic Overlay Networks for P2P Systems. Technical report, Stanford University, 2001
[36]A.Crespo, H.Garcia-Molina.Semantic overlay networks. Technical report, Stanford University, 2002
[37]A. Loser, F. Naumann, W. Siberski et al.Semantic overlay clusters within super-peer networks.In:Proceedings of the International Workshop on Databases, Information Systems and Peer-to-Peer Computing (P2PDBIS), LNCS, 2004,2944:33~47
[38]X.Liu , J.Wang, S.T.Vuong.A Category Overlay Infrastructure for Peer-to-Peer Content Search.In:Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05),2005,9:204a
[39]C. Doulkeridis, K. N?rvag, M. Vazirgiannis.DESENT: decentralized and distributed semantic overlay generation in P2P networks.IEEE Journal on Selected Areas in Communications, Jan.2007, 25(1):25~34
[40]C. Doulkeridis, K. N?rvag, M. Vazirgiannis.The SOWES approach to P2P web search using semantic overlays.In: Proceedings of the 15th international conference on World Wide Web(WWW),2006,1027~1028
[41]H.Jin, X.Ning, H.Chen et al.Efficient query routing for information retrieval in semantic overlays.In:Proceedings of the 2006 ACM symposium on applied computing,2006,1669~1673
[42]S.Voulgaris, A.M.Kermarrec, L.Massoulie.Exploiting semantic proximity in peer-to-peer content searching.In: Proceedings of 10th IEEE International Workshop on Future Trends of Distributed Computing Systems, May 2004, 238~243
[43]J.X.Parreira, S.Michel, G.Weikum.p2pDating: Real life inspired semantic overlay networks for Web search.Information Processing and Management, May 2007, 43(3):643~664
[44]A.R.Bharambe, M.Agrawal, S.Seshan.Mercury: supporting scalable multi-attribute range queries.In: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications, 2004, 353~366
[45]M.Bender, S.Michel, P.Triantafillou et al.MINERVA: collaborative P2P search.In: Proceedings of the 31st international conference on Very large data bases, 2005, 1263~1266
[46]C. Tang, Z. Xu, S. Dwarkadas.Peer-to-peer information retrieval using self-organizing semantic overlay networks.In:Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications, Karlsruhe, Germany, 2003, 175~186
[47]M.Schlosser, M.Sintek, S.Decker.HyperCuP-Hypercubes.Ontologies and Efficient Search on P2P Networks.In: Proceedings of Workshop on Agents and P2P Computing, LNCS, 2002, 2530:133~134
[48]T.Luu, F.Klemm, I.Podnar et al.ALVIS peers: a scalable full-text peer-to-peer retrieval engine.In: Proceedings of the international workshop on Information retrieval in peer-to-peer networks, 2006, 41~48
[49]O.D.Sahin, F.Emekci, D.Agrawal et al.Content-Based Similarity Search over Peer-to-Peer Systems.In: Proceedings of the International Workshop on Databases, Information Systems, and Peer-to-Peer Computing, LNCS, 2004,3367:61~78
[50]C.Tang, Z.Xu, M.Mahalingam.Peersearch: Efficient information retrieval in peer-to-peer networks.In: Proceedings of HotNets-I, ACM SIGCOMM, 2002
[51]H.T.Shen, Y.Shu, B.Yu.Efficient semantic-based content search in P2P network.IEEE Transactions on Knowledge and Data Engineering, July 2004, 16(7):813~826
[52]J.Broekstra, M.Ehrig, P.Haase et al.A metadata model for semantics-based peer-to-peer systems.In: Proceedings of the WWW’03 Workshop on Semantics in Peer-to-Peer and Grid Computing, 2003
[53]W.Nejdl, B.Wolf, C.Qu et al.EDUTELLA: a P2P networking infrastructure based on RDF.In:Proceedings of the 11th international conference on World Wide Web, Honolulu, Hawaii, USA , 2002, 604~615
[54]S.Castano, S.Ferrara, S.Montanelli et al.Ontology-addressable contents in p2p networks.In:Proceedings of the WWW’03 Workshop on Semantics in Peer-to-Peer and Grid Computing, 2003
[55]H.Xiao and I.F.Cruz.Ontology-based query rewriting in peer-to-peer networks.In:Proceedings of the 2nd International Conference on Knowledge Engineering and Decision Support, 2006,11~18
[56]M.Cai and M.Frank.RDFpeers: A scalable distributed RDF repository based on a structured peer-to-peer network.In:Proceedings of the 13th International World Wide Web Conference (WWW), 2004,17~22
[57]B.Ahlborn, W.Nejdl, and W.Siberski.OAI-P2P: A peer-to-peer network for open archives.In:Proceedings of International Conference on Parallel Processing Workshops (ICPPW02), 2002,462~468
[58]P.Haase, J.Broekstra, M.Ehrig et al.Bibster– A Semantics-Based Bibliographic Peer-to-Peer System.In: Proceedings of the 3nd International Semantic Web Conference, Japan, November 2004, 122~136
[59]R.Siebes.pNear: combining content clustering and distributed hash tables.In: Proceedings of the IEEE’05 Workshop on Peer-to-Peer Knowledge Management, 2005
[60]R.Siebes, S.Kotoulas.pRoute: Expertise-based selection using shared term similarity matrices.In:Proceedings of the 17th Belgian-Dutch Conference on Artificial Intelligence,2005,202~208
[61]H.Zhuge, J.Liu, L.Feng et al.Query routing in a peer-to-peer semantic link network.Computational Intelligence, 2005, 21(2):197~216
[62]M.Li, W.C.Lee, A.Sivasubramaniam et al.A small world overlay network for semantic based search in P2P systems.In: Proceedings of Workshop on Semantics in Peerto-Peer and Grid Computing (SemPGrid), in conjunction with the World Wide Web Conference (WWW), 2004
[63]M.Li, W.C.Lee, A.Sivasubramaniam et al.Semantic small world: an overlay network for peer-to-peer search.In: Proceedings of the 12th IEEE International Conference on Network Protocols, 2004, 228~238
[64]R.Akavipat, L.S.Wu, F.Menczer.Small World Peer Networks in Distributed Web Search.In:Proceedings of the 13th international World Wide Web conference on Alternate track papers and posters,2004,396~397
[65]L.S.Wu, R.Akavipat, F.Menczer.6S:Distributing crawling and searching across Web peers.In:Proceedings of the IASTED International Conference on Web technologies, Applications, and Services, Calgary, Canada,July 2005
[66]R.Akavipat, L.S.Wu, F.Menczer et al.Emerging semantic communities in peer web search.In:Proceedings of the international workshop on Information retrieval in peer-to-peer networks,Arlington,Virginia, USA,2006,1~8
[67]H.Jin,X.Ning, H.Chen.Efficient search for peer-to-peer information retrieval using semantic small world.In:Proceedings of the 15th international conference on World Wide Web,Edinburgh,Scotland,2006, 1003~1004
[68]H.Jin,X.Ning.Improving Search in Peer-to-Peer Literature Sharing Systems via Semantic Small World.In:Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing,2007, 31~38
[69]H.Zhang, A.Goel, R.Govindan.Using the small-world model to improve Freenet performance.Computer Networks: The International Journal of Computer and Telecommunications Networking, Elsevier North-Holland, Inc.2004, 46(4):555~574
[70]L.Liu, S.Mackin, N.Antonopoulos.Small World Architecture for Peer-to-Peer Networks.In: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology, 2006, 451~454
[71]周晋,路海明,李衍达,用Small-World设计无组织P2P系统的路由算法,软件学报,2004,15(6):915~923
[72]周晋,李衍达,基于Small-World网络的非结构化DHT算法,计算机研究与发展,2005,42(1):109~117
[73]邹福泰,基于分布式哈希表的对等系统关键技术研究:[博士学位论文],上海;上海交通大学,2004
[74]S.Milgram.The small world problem.Psychology Today, 1967,2:60~67
[75]J.Travers, S.Milgram.An experimental study of the small world problem.Sciometry, 1969, 32(4): 425~443
[76]R.Albert, H.Jeong, A.L.Barabasi.The diameter of the World Wide Web.Nature,1999,401(6749):130
[77]H.Kautz, B.Selman, M.Shah.ReferralWeb: Combining Social Networks and Collaborative Filtering.Communications of the ACM, March 1997, 40(3):63~65
[78]D.J.Watts, S.H.Strogatz.Collective Dynamics of Small-World Networks.Nature, 1998, 393:440~442
[79]J.Kleinberg.Navigation in a small world.Nature,2000,406:845
[80]J.Kleinberg.The small-world phenomenon:An algorithm perspective.In:Proceedings of the 32nd Annual ACM Symposium on Theory of Computing,2000,163~170
[81]J.Kleinberg.The small-world phenomenon and Decentralized Search.SIAM news,2004,37(3)
[82]P.Erdos, A.Renyi.On the evolution of random graphs.Publications of the Mathematical Institute of the Hungarian Academy of Sciences, 1960, 5:17~61
[83]P.Erdos, A.Renyi.On random graphs.Publicationes Mathematicae, 1959, 6:290~297
[84]M.E.J. Newman,D.J.Watts.Scaling and percolation in the small-world network model.Physical Review, 1999, E 60:7332~7342
[85]B.BollobAs.Random Graphs.Academic Press, 1985
[86]L.A.N. Amaral, A.Scala, M.Barthklkmy et al.Classes of small-world networks, In: Proceedings of the National Academy of Sciences,2000 ,11149~11152
[87]A.L.BarabAsi, R.Albert.Emergence of scaling in random networks, Science,1999,286:509~512
[88]D.J.Watts.Small Worlds: The Dynamics of Networks Between Order and Randornness.Princeton University Press, Princeton, New Jersey, 1999.
[89]A.Barrat, M.Weigt.On the properties of small-world network models The European Physical Journal B - Condensed Matter and Complex Systems,2000, 13(3):547~560
[90]M.E.J.Newman, D.J.Watts.Renormalization group analysis of the small-world network model.Physics Letters A, 1999, 263(4-6):341~346
[91]M.E.J.Newman, C.Moore, D.J.Watts.Mean-Field Solution of the Small-World Network Model.Physical Review Letter, 2000, 84(14):3201~3204
[92]M.E.J.Newman.The structure and function of networks.SIAM Review, 2002, 45(2):167~256
[93]R.Baeza-Yates, B.Ribeiro-Neto, Mordern Information Retrieval(王知津等译),北京:机械工业出版社,2005.
[94]S.E.Robertson, K.S.Jones.Relevance weighting of search terms.Journal of the American Society for Information Science, 1976, 27(3):129~146
[95]G.Salton, M.McGill.Introduction to Modern Information Retrieval.McGraw-Hill, NewYork, 1983
[96]C.Buckley, G.Salton, J. Allan et al.Automatic query expansion using SMART: TREC 3.In:Overview of the Third Text REtrieval Conference, National Institute of Standards and Technology Special Publication 500-226, NIST,Gaithersburg, MD, April 1995, 69~80
[97]M.Berry, Z.Drmac, E. Jessup.Matrices, Vector Spaces, and Information Retrieval.SIAM Review,1999,41(2):335~362
[98]M.W.Berry, S.T.Dumais, G.W.O'Brien.Using Linear Algebra for Intelligent Information Retrieval.SIAM Review, 1995, 37:573~595
[99]G.Salton, C.Buckley.Term-weighting approaches in automatic retrieval.Information Processing & Management, 1988, 24(5):513~523
[100]L.F.Chien.PAT-Tree-Based Keyword Extraction for Chinese Information Retrieval.In:Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval , Philadelphia, Pennsylvania, USA., 1997, 50~58
[101]T.H.Ong, H.Chen.Updateable PAT-Tree Approach to Chinese Key Phrase Extraction Using Mutual Information: A Linguistic Foundation for Knowledge Management.In: Proceedings of the Second Asian Digital Library Conference, Taipei, Taiwan, 1999
[102]O.Zamir, O.Etzioni.Web document clustering: a feasibility demonstration.In: Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, 1998, 46~54
[103]O.Zamir, O.Etzioni.Grouper: a dynamic clustering interface to Web search results. Computer Networks: The International Journal of Computer and Telecommunications Networking. 1999, 31(11-16): 1361~1374
[104]G.Karypis, E.H.Han, V.Kumar.Chameleon: hierarchical clustering using dynamic modeling.Computer, 1999, 32(8):68-75
[105]G.Karypis, V.Kumar.A fast and highly quality multilevel scheme for partitioning irregular graphs.SIAM Journal on Scientific Computing, 1999, 20(1):359~392
[106]G.Karypis, V.Kumar.Multilevel k-way hypergraph partitioning.In: Proceedings of the Design and Automation Conference, 1999, 243~348
[107]W.M.Shaw, R.Burgin, P.Howell.Performance standards and evaluations in IR test collections: Cluster-based retrieval models. Information Processing and Management, 1997, 33(1):1~14
[108]C.Schmitz.Self-organization of a Small World by Topic.In: Proceedings of First International Workshop on Peer-to-Peer Knowledge Management, Boston, MA, August 2004.
[109]L.Guo, S.Jiang, L.Xiao et al.Exploiting Content Localities for Efficient Search in P2P Systems.In:Proceedings of 18th International Symposium on Distributed Computing (DISC 2004), Amsterdam, Netherlands, LNCS, 2004, 3274:349~364
[110]A.Iamnitchi, M.Ripeanu, I.Foster.Small-World File-Sharing Communities.In:Proceedings of the 23rd AnnualJoint Conference of the IEEE Computer and Communications Societies, INFOCOM 2004,2:952~963
[111]A.Iamnitchi, M.Ripeanu, I.Foster.Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations.In: Proceedings of the First International Workshop on Peer-to-Peer Systems, LNCS, 2002, 2429:232~241
[112]L.A.Adamic.The Small World Web.In:Proceedings of the Third European Conference on Research and Advanced Technology for Digital Libraries, LNCS, 1999,1696:443~452
[113]M.Faloutsos, P.Faloutsos, C.Faloutsos.On power-law relationships of the Internet topology.In:Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication,1999, 251~262
[114]F.Zou, Y.Li, L.Zhang et al.A Novel Approach for Constructing Small World in Structured P2P Systems.In: Proceedings of Grid and Cooperative Computing (GCC), LNCS, 2004, 3251:807~810
[115]M.Jovanovic, F.S.Annexstein, K.A.Berman.Modeling peer-to-peer network topologies through small-world models and power laws.IX Telecommunications Forum TELFOR, 2001, 20~22
[116]S.Bordag,G.Heyer,U. Quasthoff.Small worlds of concepts and other principles of semantic search.In:Proceedings of Innovative Internet Computing Systems Second International Workshop (IICS),LNCS,2003,2877:10~19
[117]OMNeT. http://www.omnetpp.org/
[118]A.Z.Kronfol. FASD: A Fault-tolerant, Adaptive, Scalable, Distributed Search Engine. http://wortschatz.uni-leipzig.de/~fwitschel/vorlP2P/literatur/FASD.pdf,2002.
[119]Z.Xu, R.Min, Y.Hu.Reducing maintenance overhead in DHT based peer-to-peer algorithms.In: Proceedings of Third International Conference on Peer-to-Peer Computing, 2003, 218~219
[120]FreePastry. http://freepastry.org/FreePastry/tutorial/
[121]FIPS 180-1.Secure Hash Standard.USA Department of Commerce/NIST, National Technical Information Service, Springfield, VA, Apr. 1995.
[122]Oskar Sandberg.Searching in a Small World.[Doctor Dissertation], Goteborg University,Goteborg, Sweden, 2005,14~15
[123]A.B.Teslyuk, S.A.Krashakov, L.N.Shchur.On the universality of rank distributions of website popularity.Computer Networks, 2006,50(11): 1769~1780
[124]L.A.Adamic, B.A.Huberman.The Nature of Markets in the World Wide Web.Quarterly Journal of Electronic Commerce, 2000, 1(1):5~12
[125]S.C.Deerwester, S.T.Dumais, G.W.Furnas et al.Indexing by latent semantic analysis.Journal of the American Society for Information Science, 1990, 41(6):391~407
[126]M.W.Berry.Survey of Text Mining: Clustering, Classification, and Retrieval.Springer-Verlag, New York, 2004
[127]L.A.Adamic, R.M.Lukose, A.R.Puniyani et al.Search in power-law networks.Physical Review, 2001, E64:046135
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |