Efficient web matrix processing based on dual reordering

Authors:
Chih-Ming Hsu;Ming-Syan Chen
Affiliations:
National Taiwan University, Taipei, Taiwan Roc;National Taiwan University, Taipei, Taiwan Roc
Venue:
Proceedings of the 17th ACM conference on Information and knowledge management
Year:
2008

Citing 2
Cited 0

A Reordering for the PageRank Problem

SIAM Journal on Scientific Computing
Google's PageRank and Beyond: The Science of Search Engine Rankings

Google's PageRank and Beyond: The Science of Search Engine Rankings

Quantified Score

Hi-index	0.00

Visualization

Abstract

PageRank is one of the most important ranking techniques used in search engines nowadays. Since billions of pages already existed in Web, many PageRank acceleration techniques were explored by many researchers. However, in the real Web, just like the existence of pages without out-links, there are many pages without in-links. (In this paper, a Web page without in-links is called a reverse-dangling page.) Given the state of the art, we propose a new reordered PageRank algorithm, called two-way reordered PageRank algorithm, which exploits both dangling nodes and reverse-dangling nodes to reduce the computational complexity of the PageRank vector.