Usage of Tree-based Indexing Scheme in Structured P2P System

Abstract

Query processing is an essential role in large scale distributed network application environment including database indexing, distributed computing, location aware services and network monitoring system. In order to support complex queries including multi-dimensional and/or range queries, the efficiency of indexing scheme is important to be considered. This paper proposes the usage of tree-based multi-dimensional indexing scheme that is built over structured P2P overlay network. There are two phases in this indexing scheme (1) data locating phase using a balanced kd-tree (2) building of indexing mechanism which is based on the location of data on peers. This proposed indexing mechanism can support complex query processing over structured P2P overlay network and keeps load balancing among peers. In this paper, the performance of tree-based indexing mechanism is evaluated by using many simulated results.