A P2P-based incremental web ranking algorithm

In this paper, we propose an incremental algorithm for web ranking in the Peer-to-Peer (P2P) environments. Not the same as the non-incremental algorithm, the proposed algorithm can partition the web link graphs, the graphs represented the connectivity structure among the web pages, into the changed...

全面介紹

Saved in:
書目詳細資料
Main Authors: Sangamuang S., Boonma P., Natwichai J.
格式: Conference or Workshop Item
語言:English
出版: 2014
在線閱讀:http://www.scopus.com/inward/record.url?eid=2-s2.0-84855856545&partnerID=40&md5=f61d096be77dc823c076646810a11d5f
http://cmuir.cmu.ac.th/handle/6653943832/1531
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Chiang Mai University
語言: English
id th-cmuir.6653943832-1531
record_format dspace
spelling th-cmuir.6653943832-15312014-08-29T09:29:26Z A P2P-based incremental web ranking algorithm Sangamuang S. Boonma P. Natwichai J. In this paper, we propose an incremental algorithm for web ranking in the Peer-to-Peer (P2P) environments. Not the same as the non-incremental algorithm, the proposed algorithm can partition the web link graphs, the graphs represented the connectivity structure among the web pages, into the changed sub graphs, and the unchanged sub graphs. Subsequently, the algorithm processes only the necessary data in order to compute the ranking. The experiments have been conducted to evaluate the efficiency of the algorithm, comparing with the non-incremental algorithm in various P2P environments. We report the efficiency in terms of both computational and communication costs. It has been found that in terms of communication cost, the proposed algorithm can out perform the traditional one in all configurations. For the computational cost, the proposed algorithm can out perform the traditional one in all P2P network sizes but it has slightly higher computational cost when the web link graph size is large. © 2011 IEEE. 2014-08-29T09:29:26Z 2014-08-29T09:29:26Z 2011 Conference Paper 9.78077E+12 10.1109/3PGCIC.2011.28 88058 http://www.scopus.com/inward/record.url?eid=2-s2.0-84855856545&partnerID=40&md5=f61d096be77dc823c076646810a11d5f http://cmuir.cmu.ac.th/handle/6653943832/1531 English
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
language English
description In this paper, we propose an incremental algorithm for web ranking in the Peer-to-Peer (P2P) environments. Not the same as the non-incremental algorithm, the proposed algorithm can partition the web link graphs, the graphs represented the connectivity structure among the web pages, into the changed sub graphs, and the unchanged sub graphs. Subsequently, the algorithm processes only the necessary data in order to compute the ranking. The experiments have been conducted to evaluate the efficiency of the algorithm, comparing with the non-incremental algorithm in various P2P environments. We report the efficiency in terms of both computational and communication costs. It has been found that in terms of communication cost, the proposed algorithm can out perform the traditional one in all configurations. For the computational cost, the proposed algorithm can out perform the traditional one in all P2P network sizes but it has slightly higher computational cost when the web link graph size is large. © 2011 IEEE.
format Conference or Workshop Item
author Sangamuang S.
Boonma P.
Natwichai J.
spellingShingle Sangamuang S.
Boonma P.
Natwichai J.
A P2P-based incremental web ranking algorithm
author_facet Sangamuang S.
Boonma P.
Natwichai J.
author_sort Sangamuang S.
title A P2P-based incremental web ranking algorithm
title_short A P2P-based incremental web ranking algorithm
title_full A P2P-based incremental web ranking algorithm
title_fullStr A P2P-based incremental web ranking algorithm
title_full_unstemmed A P2P-based incremental web ranking algorithm
title_sort p2p-based incremental web ranking algorithm
publishDate 2014
url http://www.scopus.com/inward/record.url?eid=2-s2.0-84855856545&partnerID=40&md5=f61d096be77dc823c076646810a11d5f
http://cmuir.cmu.ac.th/handle/6653943832/1531
_version_ 1681419687898906624