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

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

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Yuh-Jzer Joung, Chien-Tse Fang, Li-Wei Yang
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Bandwidth
Costs
Fault tolerance
Information management
Information systems
Intelligent networks
Keyword search
Peer to peer computing
Redundancy
Routing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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
ISSN:1063-6927
2575-8411
DOI:10.1109/ICDCS.2005.44