Computing PageRank in a Distributed Internet Search System

Proceedings 2004 VLDB Conference: The 30th International Conference on Very Large Databases (VLDB)

Volumn , Issue , 2004, Pages 420-431

  Wang, Yuan ^a   DeWitt, David J ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85136009063     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-012088469-8.50039-5     Document Type: Chapter

References (27)

1. L.A. Barroso, J. Dean and U. Hölzle (March/April, 2003) Web Search for a Planet: The Google Cluster Architecture. IEEE Micro 23(2), 22-28.
2. K. Bharat, B.-W. Chang, M.R. Henzinger and M. Ruhl (2001) Who Links to Whom: Mining linkage between Web Sites. Proceedings of the 2001 IEEE International Confere ce on Data Mining (ICDM'01)
3. S. Brin and L. Page (1998) The Anatomy of a Large-Scale Hypertextual Web Search Engine. Proceedings of the 7th International World Wide Web Conference (WWW7)
4. S. Chakrabarti, B. Dom, D. Gibson, S.R. Kumar, P. Raghavan, S. Rajagopalan and A. Tomkins (1998) Spectral Filtering for Resource Discovery. ACM SIGIR workshop on Hypertext Information Retrieval on the Web
5. J. Cho, H. Garcia-Molina and L. Page (1998) Efficient Crawling Through URL ordering. Proceedings of the 7th International World Wide Web Conference (WWW7)
6. The IBM CLEVER Searching project http://www.almaden.ibm.com/cs/k53/clever.html Available at
7. P. Diaconis (1998) Group Representation in Probability and Statistics. Number 11 in IMS Lecture Series Institute of Mathematical Statistics
8. P. Druschel and A. Rowstron (2001) Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001)
9. R. Fagin, R. Kumar and D. Sivakumar (2003) Comparing top k lists. SIAM J. Discrete Mathematics 17(1), 134-160.
10. T.H. Haveliwala (1999) Efficient Computation of PageRank. Stanford University Technical Report
11. T.H. Haveliwala (2002) Topic-Sensitive PageRank. Proceedings of the 11th International World Wide Wide Web Conference (WWW12)
12. The Gnutella http://www.gnutella.com
13. G. Jeh and J. Widom (2003) Scaling Personalized Web Search. Proceedings of the 12th International World Wide Web Conference (WWW12)
14. S.D. Kamvar, T.H. Haveliwala, C.D. Manning and G.H. Golub (2003) Exploiting the Block Structure of the Web for Computing PageRank. Stanford University Technical Report
15. S.D. Kamvar, T.H. Haveliwala, C.D. Manning and G.H. Golub (2003) Extrapolation Methods for Accelerating PageRank Computations. Proceedings of the 12th International World Wide Web Conference (WWW12)
16. M.G. Kendall and J.D. Gibbons (1990) Rank Correlation Methods London: Edward Arnold
17. J. Kleinberg (1998) Authoritative Sources in a Hyperlinked Environment. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms
18. M. Koster, A Standard for Robot Exclusion. available at http://www.robotstxt.org/wc/norobots.html
19. P. Lyman, H.R. Varian, K. Swearingen, P. Charles, N. Good, L.L. Jordan and J. Pal (2003) How Much Information 2003? School of Information Management and Systems, University of California at Berkeley http://www.sims.berkeley.edu/how-much Available at
20. M. Najork and J.L. Wiener (2001) Breath-First Search Crawling Yields High-Quality Pages. Proceedings of the 10th International World Wide Web Conference (WWW10)
21. Netcraft Ltd. Web Server Survey. Available at http://news.netcraft.com/archives/web_server_survey.html
22. L. Page, S. Brin, R. Motwani and T. Winograd (1998) The PageRank Citation Ranking: Bringing Order to the Web. Stanford Digital Libraries Working Paper
23. S. Raghavan and H. Garcia-Molina (2001) Crawling the Hidden Web. Proceedings of the 27th International Conference on Very Large Data Bases (VLDB'01)
24. S. Ratnasamy, P. Francis, M. Handley, R.M. Karp and S. Shenker (2001) A Scalable Content-Addressable Network. Proceedings of the ACA SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM'01)
25. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek and H. Balakrishnan (2001) Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. Proceedings of the ACM SIGCOMM 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM'01)
26. Y. Wang, L. Galanis, D.J., DeWitt. Galanx: An Efficient Peer-to-Peer Search Engine Systems. Available at http://www.cs.wisc.edu/~yuanwang
27. B.Y. Zhao, J.D. Kubiatowicz and A.D. Joseph (2001) Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing. UC Berkeley Computer Science Division Report No. UCB/CSD 01/1141