Study of the AVL-tree index range query based on P2P networks

摘要

The complex multi-attribute query processing in the large-scale distributed systems is a research topic focused by both academia and industry. This paper introduces a common architecture of the multi-dimensional data range queries based on the P2P network and constructs a virtual hierarchical tree based on space division which ensures that the exploration of the relevant query regions occurred between the nodes in the same layer as far as possible. Thereby the query burden of the upper node will be reduced and the bottlenecks of the root node can be cleared which will reduce the updating cost effectively. Through the simulations the method has been proved to be effective.