Supporting Efficient Keyword-Based File Search in Peer-to-Peer File Sharing Systems

Peer-to-Peer (P2P) computing has become a popular distributed computing paradigm thanks to abundant computing power of modern desktop workstations and widely available network connectivity via the Internet. Although P2P file sharing provides a scalable alternative to conventional server-based approaches, providing efficient file search in a large scale dynamic P2P system remains a challenging problem. In this paper, we propose a set of mechanisms to provide a scalable keyword-based file search in DHTbased P2P systems. Our proposed architecture, called Keyword Fusion, balances unfair storage consumptions at peers, transforms users’ queries to contain focused search terms. Through trace-driven simulations, we show that Keyword Fusion can reduces the storage consumption of the top 5% most loaded nodes by 50% and decrease the search traffic by up to 67% even in a modest scenario of combining two keywords.

By: Lintao Liu, Kyung Dong Ryu, Kang-Won Lee

Published in: RC23145 in 2004


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .