More efficient parallel computation of pagerank

Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'07

Volumn , Issue , 2007, Pages 861-862

  Wicks, John R ^a   Greenwald, Amy ^a  

^a Brown Univerity   (United States)

Author keywords

Pagerank; Power iteration; Web graph

Indexed keywords

EID: 36448929724     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1277741.1277946     Document Type: Conference Paper

References (5)

1. P. Boldi and S. Vigna. Codes for the world-wide web. Internet Mathematics Journal, 2(4):405-427, 2005.
2. S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. Exploiting the block structure of the web for computing pagerank. Technical report, Stanford University Technical Report, 2003.
3. C. Kohlschütter, P.-A. Chirita, and W. Nejdl. Efficient parallel computation of pagerank. In Advances in Information Retrieval, volume 3936 of Lecture Notes in Computer Science, pages 241-252. Springer, 2006.
4. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
5. Y. Wang and D. DeWitt. Computing pagerank in a distributed internet search system. In Proceedings 2004 VLDB Conference: The 30th International Conference on Very Large Databases (VLDB), San Francisco, CA, USA, 2004. Morgan Kaufmann Publishers Inc.