Exploiting Semantic Proximity in Peer-to-Peer Content Searching

A lot of recent work has dealt with improving performance of content searching in peer-to-peer file sharing systems. In this paper we attack this problem by modifying the overlay topology describing the peer relations in the system. More precisely, we create a semantic overlay, linking nodes that are "semantically close", by which we mean that they are interested in similar documents. This semantic overlay provides the primary search mechanism, while the initial peer-to-peer system provides the fail-over search mechanism. We focus on implicit approaches for discovering semantic proximity. We evaluate and compare three candidate methods, and review open questions.

• Type: Conference
• Year: 2004
• Where: FTDCS
• Authors: Spyros Voulgaris, Anne-Marie Kermarrec, Laurent Massoulié, Maarten van Steen
• Keywords: Distributed And Parallel Computing, FTDCS 2004, Peer-to-peer File Sharing, Search Mechanism, Semantic Overlay