Title: A keyword search algorithm for structured peer-to-peer networks

Authors: Adriana Szekeres, Silviu Horia Baranga, Ciprian Dobre, Valentin Cristea

Addresses: Faculty of Automatic Controls and Computers, University Politehnica of Bucharest, Spl. Independentei 313, 060042, Bucharest, Romania. ' Faculty of Automatic Controls and Computers, University Politehnica of Bucharest, Spl. Independentei 313, 060042, Bucharest, Romania. ' Faculty of Automatic Controls and Computers, University Politehnica of Bucharest, Spl. Independentei 313, 060042, Bucharest, Romania. ' Faculty of Automatic Controls and Computers, University Politehnica of Bucharest, Spl. Independentei 313, 060042, Bucharest, Romania

Abstract: Peer-to-peer (P2P) networks are largely used for file-sharing and hence must provide efficient mechanisms for searching the files stored at various nodes. The existing structured P2P overlays support only |exact-match| lookup which is hardly sufficient in a file-sharing network. This paper addresses the problem of keyword-based search in structured P2P networks. We propose a new keyword-based searching algorithm which can be implemented on top of any structured P2P overlay. We demonstrate that the proposed algorithm achieves very good searching results as it requires the minimum number of messages to be sent in order to find all the references to files containing at least the given set of keywords.

Keywords: structured networks; peer-to-peer networks; P2P networks; keyword search; dynamic distributed trees; overlay networks.

DOI: 10.1504/IJGUC.2011.042043

International Journal of Grid and Utility Computing, 2011 Vol.2 No.3, pp.204 - 214

Available online: 21 Aug 2011

Full-text access for editors Access for subscribers Purchase this article Comment on this article