English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Efficient peer-to-peer semantic overlay networks based on statistical language models

Linari, A., & Weikum, G. (2006). Efficient peer-to-peer semantic overlay networks based on statistical language models. In P2PIR '06: Proceedings of the International Workshop on Information Retrieval in Peer-to-peer Networks (pp. 9-16). New York, USA: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-22AA-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-22AB-D
Genre: Conference Paper

Files

show Files
hide Files
:
linariW06.pdf (Any fulltext), 581KB
 
File Permalink:
-
Name:
linariW06.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Linari, Alessandro1, Author           
Weikum, Gerhard1, Author           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show
hide
Free keywords: -
 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}.

Details

show
hide
Language(s): eng - English
 Dates: 2007-04-042006
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 314607
Other: Local-ID: C1256DBF005F876D-6216642A2948F841C125726700528F1C-LinariW06
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Arlington, Virginia, USA
Start-/End Date: 2006-11-11

Legal Case

show

Project information

show

Source 1

show
hide
Title: P2PIR '06: Proceedings of the International Workshop on Information Retrieval in Peer-to-peer Networks
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 9 - 16 Identifier: ISBN: 1-59593-527-4