Keyword search in DHT-based peer-to-peer networks

Although search by keywords is particularly important for resource and service discovery in P2P networks, existing techniques for keyword search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unable to facilitate ranking...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications 2007-01, Vol.25 (1), p.46-61
Main Authors: Joung, Yuh-Jzer, Yang, Li-Wei, Fang, Chien-Tse
Format: Article
Language:English
Subjects:
Costs
Councils
Fault tolerance
Hot spots
Hypercubes
Indexing
Information systems
Inserts
Keyword search
Networks
Peer to peer computing
Ranking
Redundancy
Routing
Searching
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Although search by keywords is particularly important for resource and service discovery in P2P networks, existing techniques for keyword search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unable to facilitate ranking and keyword expansion. 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:0733-8716
1558-0008
DOI:10.1109/JSAC.2007.070106