loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third IEEE International Symposium on Cluster Computing and the Grid (CCGrid'03)
Peer-to-Peer Keyword Search Using Keyword Relationship
Tokyo, Japan
May 12-May 15
ISBN: 0-7695-1919-9
Kiyohide Nakauchi, The University of Tokyo
Yuichi Ishikawa, The University of Tokyo
Hiroyuki Morikawa, The University of Tokyo
Tomonori Aoyama, The University of Tokyo
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 relashionship is shared among nodes holding similar data items. We also present implementation of our P2P search system.
Citation:
Kiyohide Nakauchi, Yuichi Ishikawa, Hiroyuki Morikawa, Tomonori Aoyama, "Peer-to-Peer Keyword Search Using Keyword Relationship," ccgrid, pp.359, Third IEEE International Symposium on Cluster Computing and the Grid (CCGrid'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.