Towards scaling fully personalized PageRank: Algorithms, lower bounds, and experiments

Internet Mathematics

Volumn 2, Issue 3, 2005, Pages 333-358

  Fogaras, Dániel ^a   Rácz, Balázs ^a   Csalogány, Károly ^a   Sarlós, Tamás ^a  

^a INSTITUTE FOR COMPUTER SCIENCE AND CONTROL   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84924122981     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2005.10129104     Document Type: Article

References (40)

1. Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. “Approximating Aggregate Queries about Web Pages via Random Walks.” In Proceedings of the 26th International Conference on Very Large Data Bases, pp. 535–544. San Francisco: Morgan Kaufmann Publishers Inc., 2000.
2. Z. Bar-Yossef, A. Z. Broder, R. Kumar, and A. Tomkins. “Sic transit gloria telae: Towards an Understanding of theWeb’s Decay.” In Proceedings of the 13th International Conference on World Wide Web, pp. 328–337. New York: ACM Press, 2004.
3. P. Boldi and S. Vigna. “The Webgraph Framework I: Compression Techniques.” In Proceedings of the 13th International Conference on World Wide Web, pp. 595–602. New York: ACM Press, 2004.
4. P. Boldi, M. Santini, and S. Vigna. “Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations.” In Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004, Proceedings, pp. 168–180, Lecture Notes in Computer Science 3243. Berlin: Springer, 2004.
5. A. Borodin, G. O. Roberts, J. S. Rosenthal, and P. Tsaparas. “Finding Authorities and Hubs from Link Structures on the World Wide Web.” In Proceedings of the 10th International Conference on World Wide Web, pp. 415–429. New York: ACM Press, 2001.
6. S. Brin and L. Page. “The Anatomy of a Large-Scale Hypertextual Web Search Engine.” Computer Networks and ISDN Systems 30:1–7 (1998), 107–117.
7. A. Z. Broder. “On the Resemblance and Containment of Documents.” In Proceedings of the Compression and Complexity of Sequences 1997, pp. 21–29. Los Alamitos, CA: IEEE Computer Society, 1997.
8. Y.-Y. Chen, Q. Gan, and T. Suel. “I/O-Efficient Techniques for Computing PageRank.” In Proceedings of the 11th International Conference on Information and Knowledge Management, pp. 549–557. New York: ACM Press, 2002.
9. Paul-Alexandru Chirita, D. Olmedilla, and W. Nejdl. “PROS: A Personalized Ranking Platform for Web Search.” In Adaptive Hypermedia and Adaptive Web-Based Systems: Third International Conference, AH 2004, Eindhoven, The Netherlands, August 23–26, 2004, Proceedings, pp. 34–43, Lecture Notes in Computer Science 3137. Berlin: Springer, 2004.
10. E. Cohen. “Size-Estimation Framework with Applications to Transitive Closure and Reachability.” J. Comput. Syst. Sci. 55:3 (1997), 441–453.
11. J. Dean and S. Ghemawat. “MapReduce: Simplified Data Processing on Large Clusters.” In Proceedings of the 6th Symposium on Operating Systems Design and Implementation (OSDI), pp. 137–150. San Francisco: USENIX Association, 2004.
12. C. Dwork, S. R. Kumar, M. Naor, and D. Sivakumar. “Rank Aggregation Methods for the Web.” In Proceedings of the 10th International Conference on World Wide Web, pp. 613–622. New York: ACM Press, 2001.
13. N. Eiron and K. S. McCurley. “Locality, Hierarchy, and Bidirectionality in the Web.” Presented at Second Workshop on Algorithms and Models for the Web-Graph (WAW 2003). Available from World Wide Web (http://mccurley.org/papers/graph.pdf), 2003.
14. R. Fagin, R. Kumar, K. McCurley, J. Novak, D. Sivakumar, J. Tomlin, and D. Williamson. “Searching the Workplace Web.” In Proceedings of the 12th International Conference on World Wide Web Conference, pp. 366–375. New York: ACM Press, 2003.
15. R. Fagin, R. Kumar, and D. Sivakumar. “Comparing Top k Lists.” In Proceedings of the Fourteenth ACM-SIAM Symposium on Discrete Algorithms, pp. 26–36, Philadelphia: SIAM, 2003. Full version in SIAM Journal on Discrete Mathematics 17:1 (2003), 134–160
16. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. “Comparing and Aggregating Rankings with Ties.” In Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 47–58. New York: ACM Press, 2004.
17. D. Fogaras. “Where to Start Browsing the Web?” In Innovative Internet Community Systems: Third International Workshop IICS 2003, Leipzig, Germany, June 19–21, 2003, Revised Papers, pp. 65–79, Lecture Notes in Computer Science 2877. Berlin: Springer, 2003.
18. D. Fogaras and B. Rácz. “A Scalable Randomized Method to Compute Link-Based Similarity Rank on the Web Graph.” In Current Trends in Database Technology—EDBT 2004 Workshops: EDBT 2004 Workshops PhD, Data X, PIM, P2P&DB, and ClustWeb, Heraklion, Crete, Greece, March 14–18, 2004, Revised Selected Papers, edited by W. Lindner et al., pp. 557–565, Lecture Notes in Computer Science 3268. Berlin: Springer, 2004.
19. D. Fogaras and B. Rácz. “Scaling Link-Based Similarity Search.” In Proceedings of the 14th International Conferece on World Wide Web, pp. 641–650. New York: ACM Press, 2005.
20. T. H. Haveliwala. “Topic-Sensitive PageRank.” In Proceedings of the 11th International Conference on World Wide Web, pp. 517–526. New York: ACM Press, 2002.
21. T. H. Haveliwala. “Efficient Encodings for Document Ranking Vectors.” In Proceedings of the International Conference on Internet Computing, IC’03, Las Vegas, Nevada, USA, June 23–26, 2003, Vol. 1, pp. 3–9. Las Vegas: CSREA Press, 2003.
22. T. H. Haveliwala, S. Kamvar, and G. Jeh. “An Analytical Comparison of Approaches to Personalizing PageRank.” Technical report, Stanford University, 2003.
23. M. R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork. “Measuring Index Quality Using RandomWalks on theWeb.” Computer Networks 31:11–16 (1999), 1291–1303.
24. M. R. Henzinger, P. Raghavan, and S. Rajagopalan. “Computing on Data Streams.” In External Memory Algorithms, edited by J. M. Abello and J. S. Vitter, pp. 107–118. Providence, RI: American Mathematical Society, 1999.
25. M. R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork. “On Near-Uniform URL Sampling.” In Proceedings of the Ninth International World Wide Web Conference, pp. 295–308. Amsterdam: North-Holland Publishing Co., 2000.
26. J. Hirai, S. Raghavan, H. Garcia-Molina, and A. Paepcke. “WebBase: A Repository of Web Pages.” In Proceedings of the Ninth International World Wide Web Conference, pp. 277–293. Amsterdam: North-Holland Publishing Co., 2000.
27. G. Jeh and J. Widom. “Scaling Personalized Web Search.” In Proceedings of the 12th International Conference World Wide Web, pp. 271–279. New York: ACM Press, 2003.
28. S. Kamvar, T. H. Haveliwala, C. Manning, and G. Golub. “Exploiting the Block Structure of the Web for Computing PageRank.” Technical report, Stanford University, 2003.
29. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub. “Extrapolation Methods for Accelerating PageRank Computations.” In Proceedings of the 12th International Conference on World Wide Web, pp. 261–270. New York: ACM Press, 2003.
30. M. G. Kendall. Rank Correlation Methods. New York: Hafner Publishing Co., 1955.
31. J. Kleinberg. “Authoritative Sources in a Hyperlinked Environment.” Journal of the ACM 46:5 (1999), 604–632.
32. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge, UK: Cambridge University Press, 1997.
33. R. Lempel and S. Moran. “Rank Stability and Rank Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs.” Information Retrieval 8:2 (2005), 245–264.
34. Netscape Communication Corporation. “dmoz Open Directory Project.” Available from World Wide Web (http://www.dmoz.org), 2005.
35. 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.
36. C. R. Palmer, P. B. Gibbons, and C. Faloutsos. “ANF: A Fast and Scalable Tool for Data Mining in Massive Graphs.” In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 81–90. New York: ACM Press, 2002.
37. P. Rusmevichientong, D. M. Pennock, S. Lawrence, and C. L. Giles. “Methods for Sampling Pages Uniformly from the World Wide Web.” In Using Uncertainty Within Computation: Papers from the AAAI Fall Symposium, pp. 121–128. Menlo Park, CA: AAAI Press, 2001.
38. T. Sarlós, András A. Benczúr, K. Csalogány, D. Fogaras, and B. Rácz. “To Randomize or Not To Randomize: Space Optimal Summaries for Hyperlink Analysis.” Technical Report, MTA SZTAKI, November 2005. Available from World Wide Web (http://www.ilab.sztaki.hu/websearch/Publications/).
39. P. K. C. Singitham, M. S. Mahabhashyam, and P. Raghavan. “Efficiency-Quality Tradeoffs for Vector Score Aggregation.” In Proceedings of the Thirtieth International Conference on Very Large Data Bases, pp. 624–635. San Francisco: Morgan Kaufmann, 2004.
40. T. Suel and V. Shkapenyuk. “Design and Implementation of a High-Performance Distributed Web Crawler.” In Proceedings of the 18th IEEE International Conference on Data Engineering, pp. 357–368. Los Alamitos, CA: IEEE Computer Society, 2002.