Parallel Spatial Index Algorithm Based on Hilbert Partition

R-tree and its varieties are the main indiecs in spatial databases. With the increasing large amount of spatial data and its complexity, traditional database management methods' processing time grows rapidly. In this paper we present a novel spatial index method that takes advantage of the parallel distributed storage system by using the Hilbert curve and MapReduce computation model. The experiment shows good result of time performance and efficiency.