Spatial Data Partitioning Towards Parallel Spatial Database System

A new algorithm of spatial data partitioning is presented based on Hilbert curve which is one of the space filling curves.The new spatial data partitioning HCSDP algorithm gives a new vector data partitioning policy on the parallel spatial database system.Taking the characteristic of the variant-length of vector data records into account,HCSDP algorithm divides uniformly the huge volume of spatial data set into multiple parts and putting them onto the different processing nodes for avoiding the data skew.The advantages of HCSDP comparing are discassed with the algorithm used in Oracle spatial,and the validity and the efficiency of the algorithm are illustrated by the experimental results.