Haveliwala, T. (1999) Efficient Computation of PageRank. Technical Report. Stanford.
Efficient Computation of PageRank Taher H. Haveliwala (email@example.com) Abstract: This paper discusses efficient techniques for computing PageRank, a ranking metric for hypertext documents. We show that PageRank can be computed for very large subgraphs of the web (up to hundreds of millions of nodes) on machines with limited main memory. Running-time measurements on various memory configurations are presented for PageRank computation over the 24-million-page Stanford WebBase archive. We discuss several methods for analyzing the convergence of PageRank based on the induced ordering of the pages. We present convergence results helpful for determining the number of iterations necessary to achieve a useful PageRank assignment, both in the absence and presence of search queries.
|Item Type:||Techreport (Technical Report)|
|Uncontrolled Keywords:||PageRank, search engine, link structure|
|Subjects:||Computer Science > Data Mining|
|Related URLs:||Project Homepage, Project Homepage||http://infolab.stanford.edu/, http://www-diglib.stanford.edu/diglib/pub/|
|Deposited By:||Import Account|
|Deposited On:||25 Feb 2000 16:00|
|Last Modified:||28 Dec 2008 09:15|
Repository Staff Only: item control page