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: 278908.0, MPI für Informatik / Databases and Information Systems Group
On the Usage of Global Document Occurrences in Peer-to-Peer Information Systems
Authors:Papapetrou, Odysseas; Michel, Sebastian; Bender, Matthias; Weikum, Gerhard
Editors:Meersman, Robert; Tari, Zahir; Hacid, Mohand-Said; Mylopoulos, John; Pernici, Barbara; Babaoglu, Özalp; Jacobsen, Hans-Arno; Loyall, Joseph P.; Kifer, Michael; Spaccapietra, Stefano
Language:English
Publisher:Springer
Place of Publication:Heidelberg, Germany
Date of Publication (YYYY-MM-DD):2005
Title of Proceedings:On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE: OTM Confederated International Conferences, CoopIS, DOA, and ODBASE 2005
Start Page:310
End Page:328
Title of Series:Lecture Notes in Computer Science
Place of Conference/Meeting:Agia Napa, Cyprus
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
2005-10-31
Audience:Experts Only
Intended Educational Use:No
Abstract / Description:There exist a number of approaches for query processing
in Peer-to-Peer information systems that efficiently retrieve relevant
information from distributed peers. However, very few of them take into
consideration the overlap between peers: as the most popular resources (e.g.,
documents or files) are often present at most of the peers, a large fraction of
the documents eventually received by the query initiator are duplicates. We
develop a technique based on the notion of global document occurrences (GDO)
that, when processing a query, penalizes requent documents increasingly as
more and more peers contribute their local results. We argue that the
additional effort to create and maintain the GDO information is reasonably low,
as the necessary information can be piggybacked onto the existing
communication. Early experiments indicate that our approach significantly
decreases the number of peers that have to be involved in a query to reach a
certain level of recall and, thus,
decreases user-perceived latency and the wastage of network resources.
Last Change of the Resource (YYYY-MM-DD):2006-06-14
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-7FECA68172B14695C125705900410203-...
ISBN:3-540-29736-7
Full Text:
You have privileges to view the following file(s):
Coopis05.pdf  [520,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.