Caching for improved retrieval in peer-to-peer networks

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

Research Organisations

View graph of relations

Details

Original languageEnglish
Title of host publicationKommunikation in Verteilten Systemen, KiVS 2005
Subtitle of host publicationKurzbeitrage und Workshop der 14. GI/ITG-Fachtagung
PublisherGesellschaft fur Informatik (GI)
Pages171-176
Number of pages6
ISBN (print)3885793903, 9783885793908
Publication statusPublished - 2005
Event14. GI/ITG Fachtagung Kommunikation in Verteilten Systemen, KiVS 2005 - 14th GI/ITG Conference on Communication in Distributed Systems, KiVS 2005 - Kaiserslautern, Germany
Duration: 28 Feb 20053 Mar 2005

Publication series

NameLecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)
VolumeP-61
ISSN (Print)1617-5468

Abstract

In 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.

ASJC Scopus subject areas

Cite this

Caching for improved retrieval in peer-to-peer networks. / Balke, Wolf Tilo; Nejdl, Wolfgang; Siberski, Wolf et al.
Kommunikation in Verteilten Systemen, KiVS 2005: Kurzbeitrage und Workshop der 14. GI/ITG-Fachtagung. Gesellschaft fur Informatik (GI), 2005. p. 171-176 (Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI); Vol. P-61).

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Balke, WT, Nejdl, W, Siberski, W & Thaden, U 2005, Caching for improved retrieval in peer-to-peer networks. in Kommunikation in Verteilten Systemen, KiVS 2005: Kurzbeitrage und Workshop der 14. GI/ITG-Fachtagung. Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI), vol. P-61, Gesellschaft fur Informatik (GI), pp. 171-176, 14. GI/ITG Fachtagung Kommunikation in Verteilten Systemen, KiVS 2005 - 14th GI/ITG Conference on Communication in Distributed Systems, KiVS 2005, Kaiserslautern, Germany, 28 Feb 2005.
Balke, W. T., Nejdl, W., Siberski, W., & Thaden, U. (2005). Caching for improved retrieval in peer-to-peer networks. In Kommunikation in Verteilten Systemen, KiVS 2005: Kurzbeitrage und Workshop der 14. GI/ITG-Fachtagung (pp. 171-176). (Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI); Vol. P-61). Gesellschaft fur Informatik (GI).
Balke WT, Nejdl W, Siberski W, Thaden U. Caching for improved retrieval in peer-to-peer networks. In Kommunikation in Verteilten Systemen, KiVS 2005: Kurzbeitrage und Workshop der 14. GI/ITG-Fachtagung. Gesellschaft fur Informatik (GI). 2005. p. 171-176. (Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)).
Balke, Wolf Tilo ; Nejdl, Wolfgang ; Siberski, Wolf et al. / Caching for improved retrieval in peer-to-peer networks. Kommunikation in Verteilten Systemen, KiVS 2005: Kurzbeitrage und Workshop der 14. GI/ITG-Fachtagung. Gesellschaft fur Informatik (GI), 2005. pp. 171-176 (Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)).
Download
@inproceedings{82412e3b425448d3bd295c00482f90dc,
title = "Caching for improved retrieval in peer-to-peer networks",
abstract = "In 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.",
author = "Balke, {Wolf Tilo} and Wolfgang Nejdl and Wolf Siberski and Uwe Thaden",
year = "2005",
language = "English",
isbn = "3885793903",
series = "Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)",
publisher = "Gesellschaft fur Informatik (GI)",
pages = "171--176",
booktitle = "Kommunikation in Verteilten Systemen, KiVS 2005",
address = "Germany",
note = "14. GI/ITG Fachtagung Kommunikation in Verteilten Systemen, KiVS 2005 - 14th GI/ITG Conference on Communication in Distributed Systems, KiVS 2005 ; Conference date: 28-02-2005 Through 03-03-2005",

}

Download

TY - GEN

T1 - Caching for improved retrieval in peer-to-peer networks

AU - Balke, Wolf Tilo

AU - Nejdl, Wolfgang

AU - Siberski, Wolf

AU - Thaden, Uwe

PY - 2005

Y1 - 2005

N2 - In 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.

AB - In 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.

UR - http://www.scopus.com/inward/record.url?scp=84880464672&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84880464672

SN - 3885793903

SN - 9783885793908

T3 - Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)

SP - 171

EP - 176

BT - Kommunikation in Verteilten Systemen, KiVS 2005

PB - Gesellschaft fur Informatik (GI)

T2 - 14. GI/ITG Fachtagung Kommunikation in Verteilten Systemen, KiVS 2005 - 14th GI/ITG Conference on Communication in Distributed Systems, KiVS 2005

Y2 - 28 February 2005 through 3 March 2005

ER -

By the same author(s)