TRES-CORE: content-based retrieval based on the balanced tree in peer to peer systems

  • Authors:
  • Hai Jin;Jie Xu

  • Affiliations:
  • Cluster and Grid Computing Lab, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China;Cluster and Grid Computing Lab, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China

  • Venue:
  • PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most existing Peer to Peer (P2P) systems support namebased retrieval and have provided very limited support for the full-text search of document contents. In this paper, we present a scheme (TRESCORE) to support content-based retrieval. First, we propose a tree structure to organize data objects in vector-format in the P2P system, which is height-balanced so that the time complexity of search can be decreased. Second, we give a simple strategy for the placement of tree's nodes, which can guarantee both load balancing and fault tolerance. Then an efficient policy for the query is given. Besides theoretical analysis that can prove the correctness of our scheme, a simulation-based study is carried out to evaluate its performance under various scenarios finally. In this study, it shows that using this content-based retrieval scheme (TRES-CORE) is more accurate and more efficient than some other schemes in the P2P system.