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: 356473.0, MPI für Informatik / Databases and Information Systems Group
Architectural Alternatives for Information Filtering in Structured Overlay Networks
Authors:Tryfonopoulos, Christos; Zimmer, Christian; Koubarakis, Manolis; Weikum, Gerhard
Language:English
Date of Publication (YYYY-MM-DD):2007
Title of Journal:IEEE Internet Computing
Volume:11
Issue / Number:4
Start Page:24
End Page:34
Review Status:Peer-review
Audience:Experts Only
Intended Educational Use:No
Abstract / Description:Today's content providers are naturally distributed and produce large amounts
of new information every day. Peer-to-peer information filtering is a promising
approach that offers scalability, adaptivity to high dynamics, and failure
resilience. The authors developed two approaches that utilize the Chord
distributed hash table as the routing substrate, but one stresses retrieval
effectiveness, whereas the other relaxes recall guarantees to achieve lower
message traffic and thus better scalability. This article highlights the two
approaches' main characteristics, presents the issues and trade-offs involved
in their design, and compares them in terms of scalability, efficiency, and
filtering effectiveness.
Last Change of the Resource (YYYY-MM-DD):2008-02-28
External Publication Status:published
Document Type:Article
Communicated by:Gerhard Weikum
Affiliations:MPI für Informatik/Databases and Information Systems Group
Identifiers:LOCALID:C12573CC004A8E26-576171219D80156AC12573B0003923B0-...
DOI:http://doi.ieeecomputersociety.org/10.1109/MIC.200...
ISSN:1089-7801
Full Text:
You have privileges to view the following file(s):
hdms07.pdf  [4,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.