z-logo
open-access-imgOpen Access
Efficient search based on content similarity over self-organizing P2P networks
Author(s) -
Christos Doulkeridis,
Akrivi Vlachou,
Kjetil Nørvåg,
Yannis Kotidis,
Michalis Vazirgiannis
Publication year - 2009
Publication title -
peer-to-peer networking and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.518
H-Index - 32
eISSN - 1936-6450
pISSN - 1936-6442
DOI - 10.1007/s12083-009-0058-2
Subject(s) - computer science , scalability , reliability (semiconductor) , file sharing , digital content , similarity (geometry) , peer to peer , service (business) , world wide web , information retrieval , the internet , database , power (physics) , physics , economy , quantum mechanics , artificial intelligence , economics , image (mathematics)
The advent of the World Wide Web has made an enormous amount of information available to everyone and the widespread use of digital equip- ment enables end-users (peers) to produce their own digital content. This vast amount of information re- quires scalable data management systems. Peer-to-peer (P2P) systems have so far been well established in several application areas, with file-sharing being the most prominent. The next challenge that needs to be addressed is (more complex) data sharing, management and query processing, thus facilitating the delivery of a wide spectrum of novel data-centric applications to the end-user, while providing high Quality-of-Service. In this paper, we propose a self-organizing P2P system that is capable to identify peers with similar content and intentionally assign them to the same super-peer. During content retrieval, fewer super-peers need to be contacted and therefore efficient similarity search

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom