摘要： 结构化P2P网络具有良好的可扩展性，但难以支持多关键词查询、范围查询等复杂查询。该文分析已有复杂查询方法，提出一种基于Kademlia的P2P多维范围查询系统K-net。K-net在进行多维范围查询时，完成高维范围数据降维和范围划分，减少查询所需带宽。模拟结果显示，该系统具有良好的查询准确度和可扩展性。

关键词: 结构化P2P, 多维范围, 空间填充曲线

Abstract: Structured P2P networks has good expandability, but it is difficult to support multiple keywords query or range queries. This paper analyzes the existing complex query, and proposes a P2P multi-dimensional range query system based on Kademlia which named K-net. When processes multi-dimensional range query, it deals with dimension reduction and range partition simultaneously. This method can reduce the bandwidth required for query. The simulation results show that this system has good query accuracy and expansibility.

Key words: structured P2P, multi-dimensional range, space filling curve

中图分类号: 

• TP391