By Topic

Peer-to-peer keyword search using keyword relationship

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

4 Author(s)
K. Nakauchi ; Sch. of Eng., Univ. of Tokyo, Japan ; Y. Ishikawa ; H. Morikawa ; T. Aoyama

Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for Internet-scale information retrieval and search systems because they require neither any centralized directory nor any centralized management of overlay network topology and data placement. However, due to this decentralized architecture, current P2P keyword search systems lack useful global knowledge such as popularity of data items and relationships between keywords and data items. As a result, current P2P keyword search systems supports only naive text-match search and can find only data items with a keyword (or meta-data) exactly indicated in a query. In this paper, we show an efficient P2P search system which increases possibility of discovering desired data items. The key mechanism is query expansion, where a received query is expanded based on keyword relationships managed in a distributed fashion by participating nodes. Keyword relationships are improved through search and retrieval processes and each relationships is shared among nodes holding similar data items. We also present implementation of our P2P search system.

Published in:

Cluster Computing and the Grid, 2003. Proceedings. CCGrid 2003. 3rd IEEE/ACM International Symposium on

Date of Conference:

12-15 May 2003