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.
Keywords
- PageRank
- power method
- dangling nodes
- algorithm
Download conference paper PDF
References
Brin, S., Page, L., Motwami, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical report, Computer Science Department, Stanford University (1999)
Langville, A.N., Meyer, C.D.: Deeper inside pagerank. Internet Math. 1, 335–380 (2004)
Haveliwala, T.H., Kamvar, S.D.: The second eigenvalue of the google matrix. Technical report, Computer Science Department, Stanford University (2003)
Elden, L.: A note on the eigenvalues of the google matrix. Report LiTH-MAT-R-04-01 (2003)
Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Extrapolation methods for accelerating pagerank computations. In: Twelfth International World Wide Web Conference (2003)
Randall, K., Stata, R., Wickremesinghe, R., Wiener, J.: The link database: Fast access to graphs of the web. In: The IEEE Data Compression Conference (March 2002)
Adler, M., Mitzenmacher, M.: Towards compressing web graphs. In: The IEEE Data Compression Conference (March 2001)
Raghavan, S., Garcia-Molina, H.: Representing web graphs. In: The 19th IEEE Conference on Data Engineering, Bangalore, India (March 2003)
Haveliwala, T.H.: Efficient computation of pagerank. Technical report, Computer Science Department, Stanford University (Oct. 1999)
Chen, Y., Gan, Q., Suel, T.: I/o-efficient techniques for computing pagerank. In: Proc. of the 11th International Conference on Information and Knowledge Management (2002)
Kamvar, S., Haveliwala, T., Golub, G.: Adaptive methods for the computation of pagerank. Technical report, Stanford University (2003)
Lee, C., Golub, G., Zenios, S.: A fast two-stage algorithm for computing pagerank and its extension. Technical report, Stanford University (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Qiao, J., Jones, B., Thrall, S. (2007). An Efficient Algorithm and Its Parallelization for Computing PageRank. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2007. ICCS 2007. Lecture Notes in Computer Science, vol 4487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72584-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-72584-8_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72583-1
Online ISBN: 978-3-540-72584-8
eBook Packages: Computer ScienceComputer Science (R0)
