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

Authors:
Adriana Szekeres;Silviu Horia Baranga;Ciprian Dobre;Valentin Cristea
Affiliations:
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
Venue:
International Journal of Grid and Utility Computing
Year:
2011

Citing 8
Cited 0

Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Complex Queries in DHT-based Peer-to-Peer Networks

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Keyword Search in DHT-Based Peer-to-Peer Networks

ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Efficient peer-to-peer keyword searching

Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Making peer-to-peer keyword searching feasible using multi-level partitioning

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems

Quantified Score

Hi-index	0.00

Visualization

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.