Show simple item record

dc.contributor.authorBalke, Wolf-Tilo
dc.contributor.authorNejdl, Wolfgang
dc.contributor.authorSiberski, Wolf
dc.contributor.authorThaden, Uwe
dc.contributor.editorMüller, Paul
dc.contributor.editorGotzhein, Reinhard
dc.contributor.editorSchmitt, Jens B.
dc.date.accessioned2019-10-11T09:44:16Z
dc.date.available2019-10-11T09:44:16Z
dc.date.issued2005
dc.identifier.isbn3-88579-390-3
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/28421
dc.description.abstractIn modern information systems the dominant retrieval paradigms have shifted from exact matching towards retrieving a list of the most relevant objects. This is because users usually are not satisfied by arbitrarily large and unordered answer sets, but rather interested in small sets of ”best” answers. All popular ranking approaches need collection-wide information. This poses a challenge in the P2P context where each peer has only local knowledge. We discuss how to deal with collection-wide information in P2P networks and how to optimize query distribution based on query result analysis, and present evaluation results.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofKommunikation in Verteilten Systemen (KiVS)
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-61
dc.titleCaching for improved retrieval in peer-to-peer networksen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages171-176
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationKaiserslautern
mci.conference.date28. Februar bis 3. März 2005


Files in this item

Thumbnail

Show simple item record