Fast personalized PageRank on MapReduce

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2011, Pages 973-984

  Bahmani, Bahman ^a   Chakrabarti, Kaushik ^b   Xin, Dong ^c  

^a STANFORD UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

^c GOOGLE INC   (United States)

Author keywords

MapReduce; personalized pagerank

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPH THEORY; RANDOM PROCESSES;

EMPIRICAL EVALUATIONS; GRAPH DATA; GRAPH G; MAP-REDUCE; MONTE-CARLO APPROXIMATIONS; PERSONALIZED PAGERANK; RANDOM WALK;

MAPREDUCE;

EID: 79959919123     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989425     Document Type: Conference Paper

References (26)

1. Pig. http://hadoop.apache.org/pig.
2. K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova. Monte carlo methods in pagerank computation: When one iteration is sufficient. SIAM J. Numer. Anal., 45(2):890-904, 2007. (Pubitemid 351599181)
3. B. Bahmani, A. Chowdhury, and A. Goel. Fast incremental and personalized PageRank. http://arxiv.org/abs/1006.2880, 2010.
4. P. Berkhin. Bookmark-coloring algorithm for personalized pagerank computing. Internet Math, 3, 2006.
5. R. Chaiken, B. Jenkins, P.-A. Larson, B. Ramsey, D. Shakib, S. Weaver, and J. Zhou. Scope: easy and efficient parallel processing of massive data sets. Proc. VLDB Endow., 1(2):1265-1276, 2008.
6. J. Cohen. Graph twiddling in a mapreduce world. Computing in Science and Engg., 11(4):29-41, 2009.
7. N. Craswell and M. Szummer. Random walks on the click graph. In SIGIR, pages 239-246, 2007.
8. A. Das Sarma, S. Gollapudi, and R. Panigrahy. Estimating PageRank on graph streams. In PODS, pages 69-78, 2008.
9. J. Dean and S. Ghemawat. Mapreduce: simplified data processing on large clusters. In OSDI, pages 10-10, 2004.
10. D. Fogaras and B. Rácz. Towards scaling fully personalized PageRank. In WAW, pages 105-117, 2004.
11. Z. Gyöngyi, H. Garcia-Molina, and J. Pedersen. Combating web spam with trustrank. In VLDB, pages 576-587, 2004.
12. T. H. Haveliwala. Topic-sensitive pagerank. In WWW, pages 517-526, 2002.
13. M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: distributed data-parallel programs from sequential building blocks. In EuroSys, pages 59-72, 2007.
14. G. Jeh and J. Widom. Scaling personalized web search. In WWW, number 1-58113-680-3, 2003.
15. U. Kang, C. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec. Hadi: Fast diameter estimation and mining in massive graphs with hadoop, 2008.
16. U. Kang, C. E. Tsourakakis, and C. Faloutsos. Pegasus: A peta-scale graph mining system. ICDM, 0:229-238, 2009.
17. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM, pages 556-559, 2003.
18. J. Lin and C. Dyer. Data-Intensive Text Processing with MapReduce. Morgan & Claypool Publishers, 2010.
19. J. Lin and M. Schatz. Design patterns for efficient graph algorithms in mapreduce. In MLG, pages 78-85, 2010.
20. F. McSherry. A uniform approach to accelerated pagerank computation. In WWW, pages 575-582, 2005.
21. A. Y. Ng, A. X. Zheng, and M. I. Jordan. Stable algorithms for link analysis. In SIGIR, pages 258-266, 2001.
22. C. Olston, B. Reed, U. Srivastava, R. Kumar, and A. Tomkins. Pig latin: a not-so-foreign language for data processing. In SIGMOD, pages 1099-1110, 2008.
23. 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.
24. D. Rafiei and A. O. Mendelzon. What is this page known for? computing web page reputations. Comput. Netw., 33(1-6):823-835, 2000.
25. T. Sarlós, A. A. Benczúr, K. Csalogany, D. Fogaras, and B. Rácz. To randomize or not to randomize: space optimal summaries for hyperlink analysis. In WWW, pages 297-306, 2006.
26. H.-c. Yang, A. Dasdan, R.-L. Hsiao, and D. S. Parker. Map-reduce-merge: simplified relational data processing on large clusters. In SIGMOD, pages 1029-1040, Beijing, China, 2007. ACM.