中文摘要：

地理信息系统(GIS ) 逐渐地正在管理数据的很大的集合，一个因此集中的数据索引不能总是提供最可伸缩的解决方案。最近， p2p (P2P ) 网络为以一种完全分散的方式分享信息变得很流行。在这份报纸，新混合 P2P 空间索引网络(HPSIN ) 被建议，它把分布式的空铅树与基于的分布式的哈希值桌子(DHT ) 相结合维持询问效率和系统负担的弦网络平衡。另外，一个简单理论模型基于为 HPSIN 的打开的排队网络被建立。在模型，作为 M/M/1 排队处理器假定每个同伴系统的基本特征被捕获，并且平均质问延期的表示在靠近的形式被获得。理论分析和数字计算结果证明那在那里存在在效率和负担平衡之间的折衷的一个最佳点。由将开始索引水平 ls 的合适的值放为不同网络规模和询问率， HPSIN 将完成因此，延期能使适应不同 P2P 应用程序环境的最小的全面询问。

英文摘要：

Geographic information system （GIS） is increasingly managing very large sets of data, hence a centralized data index may not always provide the most scalable solution. Recently, the peer to peer （P2P） networks have become very popular for sharing information in a totally decentralized manner. In this paper, a new hybrid P2P spatial indexing network （HPSIN） is proposed, which combines distributed quad-tree with distributed Hash table （DHT） based Chord network to maintain both query efficiency and system load balance. In addition, a simple theoretical model based on opened queueing network for HPSIN is established. Assuming each peer as M/M/1 queueing processor in the model, fundamental characteristics of the system is captured, and expression of average query delay is obtained in close form. The theoretical analysis and numerical computing results show that there exists an optimum point of tradeoff between efficiency and load balance. By setting a proper value of start index level ls for different network scale and query rate, HPSIN will achieve the minimum overall query delay, therefore, can adapt to different P2P application environments.