Analysis and survey on page ranking algorithms for web and P2P networks

被引:0
作者
Qu, HC [1 ]
Fu, HG [1 ]
Yang, GC [1 ]
机构
[1] Chongqing Univ, Coll Comp Sci, Chongqing 400044, Peoples R China
来源
Proceedings of the 11th Joint International Computer Conference | 2005年
关键词
page rank; performance; P2P;
D O I
10.1142/9789812701534_0051
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Page Rank is the basis of the most modem search engines for both Internet and P2P networks, it is defined as the importance of a web page or the reputation value of a peer, viewed as a vote from all the web pages (peers) that link to it, weighted by their importance or reputation. With the exponential growth of the web size and peer nodes of Internet, knowing where to search becomes a really hard problem, optimizing and focusing search is often resolved by computing and comparing page rank values for web page or files. In this work, we present an overview of several top page ranking algorithms for Internet and P2P networks, then analyze and compare their computing performance and precision, finally give some simulation results in power law networks.
引用
收藏
页码:226 / 229
页数:4
相关论文
共 10 条
[1]  
[Anonymous], 2003, P 12 INT WORLD WID W
[2]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117
[3]  
GUHA R, 2004, OPEN RATING SYSTEMS
[4]  
Haveliwala T. H., 2002, P 11 INT C WORLD WID, P15
[5]  
JEH G, 2002, P 8 ACM INT C KNOWL
[6]  
KLEINBERG J, 2003, EXPLOITING BLOCK STR
[7]  
LU YZ, 2004, 13 WORLD WID WEB C W, P203
[8]  
NEJDL W, 2004, P P2P INF RETR WORKS
[9]  
*STANF U, 2003, 2 EIG GOOGL MATR 2 E
[10]  
STOICA I, 2001, P C APPL TECHN ARCH