Efficient multiple-keyword search in DHT-based decentralized systems

In this paper, we propose a structured peer-to-peer (P2P) search approach in distributed hash table (DHT) based decentralized systems using multiple keywords. Using multiple keywords allows users to describe file content more accurately and improves retrieval precision, which is important from the u...

Full description

Saved in:
Bibliographic Details
Main Authors: Sivaraja, S., Thiyagarajah, M., Piranavam, T., Lung, C.-H., Majumdar, S.
Format: Conference Proceeding
Language:English
Subjects:
Content based retrieval
Delay
Distributed computing
Fault tolerant systems
Indexing
Network servers
Peer to peer computing
Prototypes
Software libraries
Systems engineering and theory
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we propose a structured peer-to-peer (P2P) search approach in distributed hash table (DHT) based decentralized systems using multiple keywords. Using multiple keywords allows users to describe file content more accurately and improves retrieval precision, which is important from the userpsilas perspective and as file sharing becomes more popular. Multiple DHTs are also adopted in our approach; each is dedicated to one file type. A working prototype was implemented. This paper discusses in detail the design and implementation of the prototype and reports preliminary performance evaluation of a single DHT and multiple DHTs conducted in a lab environment.