ACM Home Page
Please provide us with feedback. Feedback
Adaptive query routing in peer web search
Full text PdfPdf (73 KB)
Source International World Wide Web Conference archive
Special interest tracks and posters of the 14th international conference on World Wide Web table of contents
Chiba, Japan
POSTER SESSION: Posters table of contents
Pages: 1074 - 1075  
Year of Publication: 2005
ISBN:1-59593-051-5
Authors
Le-Shin Wu  Indiana University, Bloomington, IN
Ruj Akavipat  Indiana University, Bloomington, IN
Filippo Menczer  Indiana University, Bloomington, IN
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 33,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1062745.1062875
What is a DOI?

ABSTRACT

An unstructured peer network application was proposed to address the query forwarding problem of distributed search engines and scalability limitations of centralized search engines. Here we present novel techniques to improve local adaptive routing, showing they perform significantly better than a simple learning scheme driven by query response interactions among neighbors. We validate prototypes of our peer network application via simulations with 500 model users based on actual Web crawls. We finally compare the quality of the results with those obtained by centralized search engines, suggesting that our application can draw advantages from the context and coverage of the peer collective.



Collaborative Colleagues:
Le-Shin Wu: colleagues
Ruj Akavipat: colleagues
Filippo Menczer: colleagues