DocumentCode :
2542000
Title :
Near-uniform range partition approach for increased partitioning in large database
Author :
Qi, Wen ; Song, Jie ; Bao, Yu-Bin
Author_Institution :
Eastern Liaoning Univ., Dandong, China
fYear :
2010
fDate :
16-18 April 2010
Firstpage :
101
Lastpage :
106
Abstract :
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.
Keywords :
divide and conquer methods; very large databases; database partitioning technique; divide and conquer method; large database; near-uniform range partition approach; real time data environment; Cleaning; Data models; Data warehouses; Fluctuations; Merging; Partitioning algorithms; Relational databases; Sorting; Large Database; Partitioning Algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Management and Engineering (ICIME), 2010 The 2nd IEEE International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-5263-7
Electronic_ISBN :
978-1-4244-5265-1
Type :
conf
DOI :
10.1109/ICIME.2010.5477529
Filename :
5477529
Link To Document :
بازگشت