Research on the Distributed Parallel Spatial Indexing Schema Based on R-Tree

To improve the efficiency of parallel processing of a spatial mass data under the distributed parallel computing environment,this paper presents a new multi-tiers parallel spatial indexing structure established in the parallel spatial indexing mechanism.Based on the high performance parallel spatial data partitioning algorithm,the indexing structure is designed according as classical methodology of parallel algorithm,which can not only ensure to obtain better load balance,but also be adapt to parallel processing of a spatial mass data.Using the system response time of the parallel processing of spatial scope query algorithm as the performance evaluation factor,the experiments are performed to prove the reasonable design and the high performance of the indexing structure that the paper presented.