Usage of Tree-based Indexing Scheme in Structured P2P System

Query processing is an essential role in largescale distributed network application environmentincluding database indexing, distributedcomputing, location aware services and networkmonitoring system. In order to support complexqueries including multi-dimensional and/or rangequeries, the efficiency of indexing scheme isimportant to be considered. This paper proposesthe usage of tree-based multi-dimensionalindexing scheme that is built over structured P2Poverlay network. There are two phases in thisindexing scheme (1) data locating phase using abalanced kd-tree (2) building of indexingmechanism which is based on the location of dataon peers. This proposed indexing mechanism cansupport complex query processing over structuredP2P overlay network and keeps load balancingamong peers. In this paper, the performance oftree-based indexing mechanism is evaluated byusing many simulated results