• Cite Icon15
  • https://doi.org/10.1007/978-3-540-39924-7_24Copy DOI Icon

PageRank Computation Using PC Cluster

  • Jan 1, 2003
  • Arnon Rungsawang +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Link based analysis of web graphs has been extensively explored in many research projects. PageRank computation is one widely known approach which forms the basis of the Google search. PageRank assigns a global importance score to a web page based on the importance of other web pages pointing to it. PageRank is an iterative algorithm applying on a massively connected graph corresponding to several hundred millions of nodes and hyper-links. In this paper, we propose an efficient implementation of PageRank computation for a large sub-graph of the web on a PC cluster. A link structure file representing the web graph of several hundred million links, and an efficient PageRank algorithm capable of computing PageRank scores very fast, will be discussed. Experimental results on a small cluster of x86 based PC with artificial 776 million links of 87 million nodes derived from the TH domain report 30.77 seconds per iteration run.

Similar Papers
  • Conference Article

Structural Analyses of Malaysian Web and Host Graphs

  • Aug 01, 2015
  • Jason Yong-Jin Tee +2
  • Research Article
  • Citations5

Application of the Clickstream-Based Web Page Importance Metric in Web Site Ranking and Rank Initialization of Infant Web Pages

  • Jan 31, 2012
  • International Journal of Advancements in Computing Technology
  • Fatemeh Ahmadiabkenari - +1
  • Conference Article
  • Citations14

An Efficient Partition-Based Parallel PageRank Algorithm

  • Jul 20, 2005
  • B Manaskasemsak +1
  • Conference Article
  • Citations2

From graph data extraction to graph layout: Web information visualization

  • Jun 01, 2010
  • Wei Lai +1
  • Conference Article
  • Citations14

The powerrank web link analysis algorithm

  • Jan 01, 2004
  • Yizhou Lu +6
  • Conference Article
  • Citations3

Lumping Method with Acceleration for the PageRank Computation

  • Jun 01, 2014
  • I.R Mendes +1
  • Conference Article
  • Citations277

A scalable pattern mining approach to web graph compression with communities

  • Jan 01, 2008
  • Gregory Buehrer +1
  • Conference Article

Analysing the tor web with high performance graph algorithms

  • Apr 30, 2019
  • Massimo Bernaschi +4
  • Book Chapter
  • Citations3

Connectivity of the Thai Web Graph

  • Apr 26, 2008
  • Kulwadee Somboonviwat +2
  • Research Article
  • Citations1

Efficient Vector Partitioning Algorithms for Graph Clustering

  • Jun 01, 2020
  • Journal of Data Intelligence
  • Hiroaki Shiokawa +1
  • Research Article
  • Citations290

Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient

  • Jan 01, 2007
  • SIAM Journal on Numerical Analysis
  • K Avrachenkov +3
  • Conference Article
  • Citations37

Extracting link spam using biased random walks from spam seed sets

  • May 08, 2007
  • Baoning Wu +1
  • Conference Article
  • Citations3

Partition-Based Parallel PageRank Algorithm

  • Jul 04, 2005
  • A Rungsawang +1
  • Research Article
  • Citations52

IMPC: Influence maximization based on multi-neighbor potential in community networks

  • Aug 07, 2018
  • Physica A: Statistical Mechanics and its Applications
  • Jiaxing Shang +5
  • Conference Article
  • Citations70

Mining large graphs: Algorithms, inference, and discoveries

  • Apr 01, 2011
  • U Kang +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.