Distributed calculation of pagerank using strongly connected components

Authors:
Michael Brinkmeier
Affiliations:
Institute for Technical and Theoretical Computer Science, Technical University of Ilmenau, Germany
Venue:
IICS'05 Proceedings of the 5th international conference on Innovative Internet Community Systems
Year:
2005

Citing 6
Cited 1

The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Topic-sensitive PageRank

Proceedings of the 11th international conference on World Wide Web
SimRank: a measure of structural-context similarity

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Inside PageRank

ACM Transactions on Internet Technology (TOIT)
Computing pagerank in a distributed internet search system

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

PageRank revisited

ACM Transactions on Internet Technology (TOIT)

Quantified Score

Hi-index	0.00

Visualization

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.