Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Databases and Information Systems Group     Display Documents



ID: 231408.0, MPI für Informatik / Databases and Information Systems Group
Bookmark-driven Query Routing in Peer-to-Peer Web Search
Authors:Bender, Matthias; Michel, Sebastian; Zimmer, Christian; Weikum, Gerhard
Editors:Callan, Jamie; Fuhr, Norbert; Nejdl, Wolfgang
Language:English
Publisher:Universität Duisburg-Essen
Place of Publication:Duisburg, Germany
Date of Publication (YYYY-MM-DD):2004
Title of Proceedings:Proceedings of the SIGIR Workshop on Peer-to-Peer Information Retrieval : 27th Annual International ACM SIGIR Conference ; SIGIR 2004 P2PIR Workshop
Start Page:1
End Page:12
Place of Conference/Meeting:Sheffield, UK
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
2004-07-25
Audience:Experts Only
Intended Educational Use:No
Abstract / Description:We consider the problem of collaborative Web search and query routing
strategies in a peer-to-peer (P2P) environment.
In our architecture every peer has a full-fledged search engine with a
(thematically focused) crawler
and a local index whose contents may be tailored to the user's specific
interest profile.
Peers are autonomous and post meta-information about their bookmarks and index
lists to
a global directory, which is efficiently implemented in a decentralized manner
using
Chord-style distributed hash tables. A query posed by one peer is first
evaluated locally;
if the result is unsatisfactory the query is forwarded to selected peers. These
peers are
chosen based on a benefit/cost measure where benefit reflects the thematic
similarity
of peers' interest profiles, derived from bookmarks, and cost captures
estimated peer load
and response time. The meta-information that is needed for making these query
routing
decisions is efficiently looked up in the global directory; it can also be
cached and
proactively disseminated for higher availability and reduced network load.
Last Change of the Resource (YYYY-MM-DD):2005-06-27
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Gerhard Weikum
Affiliations:MPI für Informatik/Databases and Information Systems Group
Identifiers:LOCALID:C1256DBF005F876D-866AC1720F945D9FC1256EDE003F3D47-...
Full Text:
You have privileges to view the following file(s):
p2psearchSIGIR2004.pdf  [191,00 Kb] [Comment:file from upload service]  
 
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.