KEYNOTE: keyword search by node selection for text retrieval on DHT-Based P2P networks

  • Authors:
  • Zheng Zhang;Shuigeng Zhou;Weining Qian;Aoying Zhou

  • Affiliations:
  • Department of Computer Science and Engineering, Fudan University, Shanghai, China;Department of Computer Science and Engineering, Fudan University, Shanghai, China;Department of Computer Science and Engineering, Fudan University, Shanghai, China;Department of Computer Science and Engineering, Fudan University, Shanghai, China

  • Venue:
  • DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Efficient full-text keyword search remains a challenging problem in P2P systems. Most of the traditional keyword search systems on DHT overlay networks perform the join operation of keywords at document level, which consumes a huge amount of storage and bandwidth. In this paper, we present KEYNOTE, a novel keyword search system that performs the join operation at node level. Compared to the traditional keyword search systems on DHTs, KEYNOTE can greatly reduce the storage and communication cost. To forward a query to the relevant nodes for searching documents, two effective node selection methods are presented. To address the hot spot problem in Chord overlay networks, an efficient load balancing scheme is introduced. Simulated experimental evaluation with up to 8,000 nodes and over 600,000 real-world documents validates the practicality of the proposed system.