Distributed Search Algorithms

Distributed Search Algorithms - Computing pagerank in a...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Subscribe (Full Service) Register (Limited Service, Free ) Login Search: The ACM Digital Library The Guide Feedback Take a look at the new version of this page: [ beta version ]. Tell us what you think. Computing pagerank in a distributed internet search system Full text Pdf (191 KB) Source Very Large Data Bases archive Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 table of contents Toronto, Canada Pages: 420 - 431 Year of Publication: 2004 ISBN:0-12-088469-0 Authors Yuan Wang Computer Sciences Department, University of Wisconsin - Madison, Madison, WI David J. DeWitt Computer Sciences Department, University of Wisconsin - Madison, Madison, WI Sponsor VLDB Endowment : Very Large Database Endowment Publisher VLDB Endowment Bibliometrics Downloads (6 Weeks): 9, Downloads (12 Months): 85, Citation Count: 12 ABSTRACT Existing Internet search engines use web crawlers to download data from the Web. Page quality is measured on central servers, where user queries are also processed. This paper argues that using crawlers has a list of disadvantages. Most importantly, crawlers do not scale. Even Google, the leading search engine, indexes less than 1% of the entire Web. This paper proposes a distributed search engine framework, in which every web server answers queries over its own data. Results from multiple web servers will be merged to generate a ranked hyperlink list on the submitting server. This paper presents a series of algorithms that compute PageRank in such framework. The preliminary experiments on a real data set demonstrate that the system achieves comparable accuracy on PageRank vectors to Google's well-known PageRank algorithm and, therefore, high quality of query results. REFERENCES Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references. Additional Information: abstract references cited by index terms collaborative colleagues Tools and Actions: Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref Page 1 of 5 Computing pagerank in a distributed internet search system 23/09/2010 http://portal.acm.org/citation.cfm?id=1316727
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
1 Luiz André Barroso , Jeffrey Dean , Urs Hölzle, Web Search for a Planet: The Google Cluster Architecture, IEEE Micro, v.23 n.2, p.22 - 28, March 2003 [doi> 10.1109/MM.2003.1196112 ] 2 Krishna Bharat , Bay - Wei Chang , Monika Rauch Henzinger , Matthias Ruhl, Who Links to Whom: Mining Linkage between Web Sites, Proceedings of the 2001 IEEE International Conference on Data Mining, p.51 - 58, November 29 - December 02, 2001 3 Sergey Brin , Lawrence Page, The anatomy of a large - scale hypertextual Web search engine, Proceedings of the seventh international conference on World Wide Web 7, p.107
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/15/2010 for the course CS 430 taught by Professor Dr.hiderman during the Fall '10 term at University of Regina.

Page1 / 5

Distributed Search Algorithms - Computing pagerank in a...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online