Efficient range queries and fast lookup services for scalable p2p networks

  • Authors:

  • Chu Yee Liau;Wee Siong Ng;Yanfeng Shu;Kian-Lee Tan;Stéphane Bressan

  • Affiliations:

  • Department of Computer Science, National University of Singapore, Singapore;Singapore-MIT Alliance, National University of Singapore, Singapore;Department of Computer Science, National University of Singapore, Singapore;Department of Computer Science, National University of Singapore, Singapore;Department of Computer Science, National University of Singapore, Singapore

  • Venue:
  • DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we propose a Peer-To-Peer (P2P) architecture using a tree based indexing scheme which allows for efficient lookup and range query services on documents in the network. We also present a basic load balancing technique by assigning a new node that joins the network to a heavily loaded area to take on some of load of its peers. Given a query, we need to search only a small number of nodes to locate matching documents hence making the architecture scalable. We also take into account the fact that nodes in a P2P environment need not have the same capability. We implemented a simulator and performed experiments to study to the performance of our proposed architecture. The results show that our proposed architecture is scalable and highly efficient when handling range queries.