Structured Network Complex Query Mechanisms Such As Research

With the rapid growth of Internet and computing power, peer-to-peer(P2P) networks have gained much attention from both industrial and academic fields. P2P networks share idle CPU power, free diskspace and network bandwidth between different nodes in a distributed and equal way. As for any used large distributed systems, the effectiveness of a P2P network largely depends on the versatility and scalability of its search mechanism.Besides centralized systems, P2P networks can be roughly classified into two categories: unstructured and DHT based structured P2P networks. Search mechanisms in unstructured P2P networks are inherently blind, which makes the search inefficient and unscalable. While structured P2P networks can provide search efficiency and scalability by deploying identifier-based search mechanism, they fail to support flexible multi-keyword search like unstructured P2P networks do. However, to make a DHT-based application practically useful, supporting multi-keyword search and range search efficiently must be done.In this thesis, we first introduce P2P network and its disadvantage. Then we analyse the new complex queries method that support large-scale distributed P2P application. Finally, we describe an efficient algorithm and data structure that support complex queries based on structured P2P network. Coupled with a dynamic load balanceing mechanism, the model can handle both point and range queries regardless of the distribution of the queries. The model is fully distributed and we avoid conventional bottleneck problems. Simulation results validate the effectiveness of the model.