An Efficient Algorithm and Its Parallelization for Computing PageRank

Authors:
Jonathan Qiao;Brittany Jones;Stacy Thrall
Affiliations:
Converse College Spartanburg, SC 29302, USA;Converse College Spartanburg, SC 29302, USA;Converse College Spartanburg, SC 29302, USA
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Year:
2007

Citing 4
Cited 0

I/O-efficient techniques for computing pagerank

Proceedings of the eleventh international conference on Information and knowledge management
Extrapolation methods for accelerating PageRank computations

WWW '03 Proceedings of the 12th international conference on World Wide Web
The Link Database: Fast Access to Graphs of the Web

DCC '02 Proceedings of the Data Compression Conference
Towards Compressing Web Graphs

DCC '01 Proceedings of the Data Compression Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an efficient algorithm and its parallelization to compute PageRank are proposed. There are existing algorithms to perform such tasks. However, some algorithms exclude dangling nodes which are an important part and carry important information of the web graph. In this work, we consider dangling nodes as regular web pages without changing the web graph structure and therefore fully preserve the information carried by them. This differs from some other algorithms which include dangling nodes but treat them differently from regular pages for the purpose of efficiency. We then give an efficient algorithm with negligible overhead associated with dangling node treatment. Moreover, the treatment poses little difficulty in the parallelization of the algorithm.