Keyword Search in DHT-Based Peer-to-Peer Networks

Authors:
Yuh-Jzer Joung;Chien-Tse Fang;Li-Wei Yang
Affiliations:
National Taiwan University;National Taiwan University;National Taiwan University
Venue:
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Year:
2005

Citing 0
Cited 9

Wildcard Search in Structured Peer-to-Peer Networks

IEEE Transactions on Knowledge and Data Engineering
Scalable tag search in social network applications

Computer Communications
SPICE: Scalable P2P implicit group messaging

Computer Communications
An Architecture for Hybrid P2P Free-Text Search

CIA '07 Proceedings of the 11th international workshop on Cooperative Information Agents XI
PHIRST: A distributed architecture for P2P information retrieval

Information Systems
Optimized union of non-disjoint distributed data sets

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Keyword searching in structured overlays via content distance addressing

DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Crawling BitTorrent DHTs for fun and profit

WOOT'10 Proceedings of the 4th USENIX conference on Offensive technologies
A keyword search algorithm for structured peer-to-peer networks

International Journal of Grid and Utility Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing techniques for keyword/attribute search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unable to facilitate ranking. In this paper, we present a general keyword index and search scheme for structured P2P networks that avoids these problems, and in which object insert, delete, and search can be efficiently performed. Some experimental results are also presented to support our claim.