Skip to content

Read-only version: For security reasons, the Research Information System (FIS) has been temporarily replaced by this read-only version. All public content and full texts remain available; login, editing, submission and statistics are not available. Questions: fis@uni-bamberg.de

Home › Publications › Scalable summary based retrieval in P2P networks

Publication

Scalable summary based retrieval in P2P networks

Müller, Wolfgang; Eisenhardt, Martin; Henrich, Andreas (2005): Scalable summary based retrieval in P2P networks, in: Otthein Herzog, Hans-Jörg Schek, Norbert Fuhr, u. a. (Hrsg.), CIKM ’05 : Proceedings of the 14th ACM international conference on Information and knowledge management, New York: ACM, S. 586–593, doi: 10.1145/1099554.1099706.

Details

Faculty/Chair
Author
Eisenhardt, Martin
Title of the compilation
CIKM '05 : Proceedings of the 14th ACM international conference on Information and knowledge management
Editors
Herzog, Otthein
Schek, Hans-Jörg
Fuhr, Norbert
Chowdhury, Abdur
Teiken, Wilfried
Conference
CIKM05: Conference on Information and Knowledge Management, 31 October 2005- 5 November 2005, Bremen, Germany
Publisher Information
ACM : New York
Year of publication
2005
ISBN
978-1-59593-140-5
Language
German
DOI
Abstract

Much of the present P2P-IR literature is focused on distributed indexing structures. Within this paper, we present an approach based on the replication of peer data summaries via rumor spreading and multicast in a structured overlay.We will describe Rumorama, a P2P framework for similar-ity queries inspired by GlOSS and CORI and their P2P-adaptation, PlanetP. Rumorama achieves a hierarchization of PlanetP-like summary-based P2P-IR networks. In a Rumorama network, each peer views the network as a small PlanetP network with connections to peers that see other small PlanetP networks. One important aspect is that each peer can choose the size of the PlanetP network it wants to see according to its local processing power and bandwidth. Even in this adaptive environment, Rumorama manages to process a query such that the summary of each peer is considered exactly once in a network without churn. However, the actual number of peers to be contacted for a query is a small fraction of the total number of peers in the network.Within this article, we present the Rumorama base protocol, as well as experiments demonstrating the scalability and viability of the approach under churn.

Keywords
P2P
Similarity Search
Distributed IR
Type
Conferenceobject
URI
Activation date
2014-09-24, 2014-09-24

Permalink: https://fis.uni-bamberg.de/handle/uniba/14571 · Data as JSON · Cite: BibTeX · RIS

Data as of: 2026-11-16

Restricted read-only access: login, editing and submission are temporarily disabled.