DocumentCode
2258722
Title
NPA: Increased Partitioning Approach for Massive Data in Real-Time Data Warehouse
Author
Song, Jie ; Bao, Yubin
Author_Institution
Northeastern Univ., Shenyang, China
fYear
2010
fDate
11-13 Aug. 2010
Firstpage
1
Lastpage
6
Abstract
In many business and scientific data warehouses, not only the data amount is growing in geometric series, but also the requirement of real-time capability is increasing. 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 a increased partitioning algorithm, so it does not adapt to the real-time data warehouse partitioning. 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 real-time data warehouse.
Keywords
data warehouses; divide and conquer methods; database partitioning technique; divide and conquer method; near uniform NPA; range partitioning algorithm; real time data warehouse; Algorithm design and analysis; Data warehouses; Indexes; Merging; Partitioning algorithms; Real time systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology Convergence and Services (ITCS), 2010 2nd International Conference on
Conference_Location
Cebu
Print_ISBN
978-1-4244-7584-1
Electronic_ISBN
978-1-4244-7584-1
Type
conf
DOI
10.1109/ITCS.2010.5581277
Filename
5581277
Link To Document