By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yuh-jzer Joung ; Dept. of Inf. Manage., Nat. Taiwan Univ., Taipei ; Li-wei Yang ; Chien-tse Fang

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.

Published in:

IEEE Journal on Selected Areas in Communications  (Volume:25 ,  Issue: 1 )