Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Linari, Alessandro
Weikum, Gerhard

dblp
dblp

Not MPG Author(s):

Linari, Alessandro

Editor(s):





BibTeX cite key*:

LinariW06

Title, Booktitle

Title*:

Efficient peer-to-peer semantic overlay networks based on statistical language models


linariW06.pdf (580.29 KB)

Booktitle*:

P2PIR '06: Proceedings of the International Workshop on Information Retrieval in Peer-to-peer Networks

Event, URLs

URL of the conference:


URL for downloading the paper:

http://delivery.acm.org/10.1145/1190000/1183582/p9-linari.pdf?key1=1183582&key2=0212731711&coll=GUIDE&dl=GUIDE&CFID=11228556&CFTOKEN=51902117

Event Address*:

Arlington, Virginia, USA

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

11 November 2006

Event End Date:

11 November 2006

Publisher

Name*:

ACM

URL:


Address*:

New York, USA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

9-16

Year*:

2006

VG Wort Pages:

40

ISBN/ISSN:

1-59593-527-4

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

In this paper we address the query routing problem in peer-to-peer ({P2P}) information retrieval. Our system builds up on the idea of a {S}emantic {O}verlay {N}etwork ({SON}), in which each peer becomes neighbor of a small number of peers, chosen among those that are most similar to it. Peers in the network are represented by a statistical Language Model derived from their local data collections but, instead of using the non-metric Kullback-Leibler divergence to compute the similarity between them, we use a symmetrized and "metricized" related measure, the square root of the Jensen-Shannon divergence, which let us map the problem to a metric search problem. The search strategy exploits the triangular inequality to efficiently prune the search space and relies on a priority queue to visit the most promising peers first. To keep communications costs low and to perform an efficient comparison between Language Models, we devise a compression technique that builds on Bloom-filters and histograms and we provide error bounds for the approximation and a cost analysis for the algorithms used to build and maintain the {SON}.

URL for the Abstract:

http://doi.acm.org/10.1145/1183579.1183582



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Databases and Information Systems Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{LinariW06,
AUTHOR = {Linari, Alessandro and Weikum, Gerhard},
TITLE = {Efficient peer-to-peer semantic overlay networks based on statistical language models},
BOOKTITLE = {P2PIR '06: Proceedings of the International Workshop on Information Retrieval in Peer-to-peer Networks},
PUBLISHER = {ACM},
YEAR = {2006},
PAGES = {9--16},
ADDRESS = {Arlington, Virginia, USA},
ISBN = {1-59593-527-4},
}


Entry last modified by Petra Schaaf, 04/04/2007
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Adriana Davidescu
Created
01/18/2007 04:01:45 PM
Revisions
6.
5.
4.
3.
2.
Editor(s)
Petra Schaaf
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Edit Dates
04.04.2007 13:47:11
13.02.2007 16:36:31
13.02.2007 16:34:40
13.02.2007 14:35:50
19.01.2007 18:17:41
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section
linariW06.pdf
View attachments here: