Abstract: The excellent linear mapping characteristics of Hilbert spatial ordering code is studied and applied to spatial partitioning of data,and a concrete algorithm is given.In this algorithm,the clustering performance of spatial objects is taken into account,and the balance of data storage on each processing node is also taken into account,which greatly improves the processing efficiency of parallel spatial database.