Abstract
We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated componentwise, as long as the rankings of pages directly linking to the current component are already known. Depending on the structure of the WWW, this approach approach may be used to calculate the ranking on several components in parallel, and allows to split the problem intio significantly small subproblems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arasu, A., Novak, J., Tomkins, A., Tomlin, J.: Pagerank computation and the structure of the web: Experiments and algorithms (2001), citeseer.ist.psu.edu/arasu02pagerank.html
Avrachenkov, K., Litvak, N.: Decomposition of the google pagerank and optimal linking strategy. Technical Report RR-5101, Institut National de Recherche en Informatique et en Automatique (2004)
Bianchini, M., Gori, M., Scarselli, F.: Inside PageRank. ACM Trans. Internet Tech. 5, 92–128 (2005)
Brin, S., Page, L.: The anatomy of a large-scale hypertextual websearch engine. In: Proc. of the 7th World Wide Web Conference (WWW7) (1998)
Brin, S., Page, L., Motwani, R., Winograd, T.: The Page-Rank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford Digital Library Technologies Project (1999), http://dbpubs.stanford.edu:8090/pub/1999-66
Brinkmeier, M.: Pagerank revisited. Technical report, Technical University Ilmenau (to appear) (2005)
Broder, A.Z., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.L.: Graph structure in the web. Computer Networks 33(1-6), 309–320 (2000)
Haveliwala, T., Kamvar, S.: The second eigenvalue of the google matrix. Technical Report 2003-20, Stanford University (2003), http://dbpubs.stanford.edu/pub/2003-20
Haveliwala, T.H.: Efficient computation of pagerank. Technical Report 1999- 31, Stanford University (1999), http://dbpubs.stanford.edu:8090/pub/1999-31
Haveliwala, T.H.: Topic-sensitive pagerank. In: Proc. of the 11th WWW Conference (WWW11), pp. 517–526 (2002)
Jeh, G., Widom, J.: SimRank: A measure of structural-context similarity. In: Proc. 8th ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining (July 2002)
Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Exploiting the block structure of the web for computing pagerank. Technical Report 2003-17, Stanford University (2003), http://dbpubs.stanford.edu:8090/pub/2003-17
Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)
Wang, Y., DeWitt, D.J.: Computing pagerank in a distributed internet search engine system. In: VLDB 2004, pp. 420–431 (2004)
Webbase project. Stanford University, http://www-diglib.stanford.edu/~testbed/doc2/WebBase/
Webgraph. University of Milano, http://webgraph.dsi.unimi.it/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brinkmeier, M. (2006). Distributed Calculation of PageRank Using Strongly Connected Components. In: Bui, A., Bui, M., Böhme, T., Unger, H. (eds) Innovative Internet Community Systems. IICS 2005. Lecture Notes in Computer Science, vol 3908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11749776_3
Download citation
DOI: https://doi.org/10.1007/11749776_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33973-1
Online ISBN: 978-3-540-33974-8
eBook Packages: Computer ScienceComputer Science (R0)