Near-uniform range partition approach for increased partitioning in large database

摘要

Database partitioning technique which adopts 'divide and conquer' method can efficiently simplify the complexity of managing massive data and improve the performance of the system, especially the range partitioning. The traditional range partitioning approach brings heavy burden to the system without an increased partitioning algorithm, so it does not adapt to the partitioning in the realtime data environment. To speed up the partitioning algorithm, the current partitioning technology is well studied and three effective range partitioning algorithms for the massive data are proposed, which based on allowing the fluctuation of data amount in each range of partitions. At last, some experiments and applications show that the proposed algorithms are more effective and efficient to partitioning and re-partitioning tables in the large database or real-time environment.