{
 "uuid": "7332d409-c4fe-40a3-a9e7-cb4f9f414c98",
 "handle": "uniba/14571",
 "type": "Publication",
 "name": "Scalable summary based retrieval in P2P networks",
 "url": "/entities/publication/7332d409-c4fe-40a3-a9e7-cb4f9f414c98/",
 "lastModified": "2025-11-11T03:32:01.047+00:00",
 "metadata": {
  "cris.virtual.author-orcid": [
   {
    "value": null
   },
   {
    "value": null
   },
   {
    "value": "0000-0002-5074-3254"
   }
  ],
  "cris.virtualsource.author-orcid": [
   {
    "value": "34c59fb2-4ca9-42b1-8813-410cb28a957b"
   },
   {
    "value": "c6f61f4c-5d52-4c41-a2fd-2d3933d09618"
   },
   {
    "value": "c7ef683c-5c35-441f-8b54-80b6be49f16c"
   }
  ],
  "dc.contributor.author": [
   {
    "value": "Müller, Wolfgang",
    "authority": "34c59fb2-4ca9-42b1-8813-410cb28a957b",
    "language": "de_DE"
   },
   {
    "value": "Eisenhardt, Martin",
    "authority": "c6f61f4c-5d52-4c41-a2fd-2d3933d09618",
    "language": "de_DE"
   },
   {
    "value": "Henrich, Andreas",
    "authority": "c7ef683c-5c35-441f-8b54-80b6be49f16c",
    "language": "de_DE"
   }
  ],
  "dc.date.accessioned": [
   {
    "value": "2019-09-19T15:49:39Z",
    "language": "de_DE"
   }
  ],
  "dc.date.available": [
   {
    "value": "2014-09-24T11:15:22+02:00",
    "language": "de_DE"
   }
  ],
  "dc.date.issued": [
   {
    "value": "2005",
    "language": "de_DE"
   }
  ],
  "dc.description.abstract": [
   {
    "value": "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."
   }
  ],
  "dc.identifier.doi": [
   {
    "value": "10.1145/1099554.1099706"
   }
  ],
  "dc.identifier.isbn": [
   {
    "value": "978-1-59593-140-5"
   }
  ],
  "dc.identifier.uri": [
   {
    "value": "https://fis.uni-bamberg.de/handle/uniba/14571"
   }
  ],
  "dc.language.iso": [
   {
    "value": "deu",
    "language": "de_DE"
   }
  ],
  "dc.language.title": [
   {
    "value": "deu",
    "language": "de_DE"
   }
  ],
  "dc.publisher": [
   {
    "value": "ACM"
   }
  ],
  "dc.publisher.place": [
   {
    "value": "New York"
   }
  ],
  "dc.relation.authororgunit": [
   {
    "value": null,
    "authority": "#PLACEHOLDER_PARENT_METADATA_VALUE#",
    "language": "de_DE"
   },
   {
    "value": null,
    "authority": "#PLACEHOLDER_PARENT_METADATA_VALUE#",
    "language": "de_DE"
   },
   {
    "value": null,
    "authority": "#PLACEHOLDER_PARENT_METADATA_VALUE#",
    "language": "de_DE"
   }
  ],
  "dc.subject": [
   {
    "value": "P2P"
   },
   {
    "value": "Similarity Search"
   },
   {
    "value": "Distributed IR"
   }
  ],
  "dc.title": [
   {
    "value": "Scalable summary based retrieval in P2P networks",
    "language": "de_DE"
   }
  ],
  "dc.type": [
   {
    "value": "conferenceobject",
    "language": "de_DE"
   }
  ],
  "dspace.entity.type": [
   {
    "value": "Publication"
   }
  ],
  "ubg.conference.name": [
   {
    "value": "CIKM05: Conference on Information and Knowledge Management, 31 October 2005- 5 November 2005"
   }
  ],
  "ubg.conference.place": [
   {
    "value": "Bremen, Germany",
    "language": "de_DE"
   }
  ],
  "ubg.editor.articlecollection": [
   {
    "value": "Herzog, Otthein",
    "authority": "36e0d349-9caa-4e25-9185-fbcf89522403"
   },
   {
    "value": "Schek, Hans-Jörg"
   },
   {
    "value": "Fuhr, Norbert",
    "authority": "5ddd3c11-6f39-4c86-82a0-e5a384d0b333"
   },
   {
    "value": "Chowdhury, Abdur"
   },
   {
    "value": "Teiken, Wilfried"
   }
  ],
  "ubg.faculty.org": [
   {
    "value": "Lehrstuhl für Medieninformatik",
    "authority": "9aa88ac1-ebeb-4a57-a395-895f179d27a5",
    "language": "de_DE"
   }
  ],
  "ubg.fulltexticon": [
   {
    "value": "true"
   }
  ],
  "ubg.generated.csl": [
   {
    "value": "<div class=\"csl-bib-body\">\n  <div class=\"csl-entry\">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.), <i>CIKM ’05 : Proceedings of the 14th ACM international conference on Information and knowledge management</i>, New York: ACM, S. 586–593, doi: 10.1145/1099554.1099706.</div>\n</div>"
   }
  ],
  "ubg.generated.cslContainerTitle": [
   {
    "value": "CIKM '05 : Proceedings of the 14th ACM international conference on Information and knowledge management"
   }
  ],
  "ubg.generated.cslDoi": [
   {
    "value": "10.1145/1099554.1099706"
   }
  ],
  "ubg.generated.cslEditor": [
   {
    "value": "Herzog, Otthein",
    "authority": "36e0d349-9caa-4e25-9185-fbcf89522403"
   },
   {
    "value": "Schek, Hans-Jörg",
    "authority": "9cccacd9-2cec-4234-bdf3-3ca54c3b6604"
   },
   {
    "value": "Fuhr, Norbert",
    "authority": "5ddd3c11-6f39-4c86-82a0-e5a384d0b333"
   },
   {
    "value": "Chowdhury, Abdur",
    "authority": "1be5e4ac-8e7b-4c09-909d-f59e4c812195"
   },
   {
    "value": "Teiken, Wilfried",
    "authority": "b12c08fa-e9a2-4f46-bf6b-ce522dcd8c8b"
   },
   {
    "value": "Schek, Hans-Jörg"
   },
   {
    "value": "Chowdhury, Abdur"
   },
   {
    "value": "Teiken, Wilfried"
   }
  ],
  "ubg.intern.opusdatepublished": [
   {
    "value": "2014-09-24T11:15:22+02:00",
    "language": "de_DE"
   }
  ],
  "ubg.intern.org": [
   {
    "value": "Lehrstuhl für Medieninformatik",
    "authority": "9aa88ac1-ebeb-4a57-a395-895f179d27a5",
    "language": "de_DE"
   }
  ],
  "ubg.intern.vonfeld": [
   {
    "value": "",
    "language": "de_DE"
   }
  ],
  "ubg.intern.vonfeldeditor": [
   {
    "value": "",
    "language": "de_DE"
   }
  ],
  "ubg.pages.range": [
   {
    "value": "586-593"
   }
  ],
  "ubg.submission.type": [
   {
    "value": "full-text",
    "language": "de_DE"
   }
  ],
  "ubg.titleparent.articlecollection": [
   {
    "value": "CIKM '05 : Proceedings of the 14th ACM international conference on Information and knowledge management"
   }
  ],
  "ubg.version.hasversions": [
   {
    "value": "uniba/106621",
    "authority": "7ec84d72-6849-4cb7-a73b-fd9b7d75b8b7"
   }
  ]
 },
 "relations": {},
 "files": []
}