Efficient parallel computation of pagerank

  • Authors:
  • Christian Kohlschütter;Paul-Alexandru Chirita;Wolfgang Nejdl

  • Affiliations:
  • L3S Research Center/University of Hanover, Hanover, Germany;L3S Research Center/University of Hanover, Hanover, Germany;L3S Research Center/University of Hanover, Hanover, Germany

  • Venue:
  • ECIR'06 Proceedings of the 28th European conference on Advances in Information Retrieval
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

PageRank inherently is massively parallelizable and distributable, as a result of web's strict host-based link locality. We show that the Gauß-Seidel iterative method can actually be applied in such a parallel ranking scenario in order to improve convergence. By introducing a two-dimensional web model and by adapting the PageRank to this environment, we present efficient methods to compute the exact rank vector even for large-scale web graphs in only a few minutes and iteration steps, with intrinsic support for incremental web crawling, and without the need for page sorting/reordering or for sharing global rank information.