Name
Title | ||
|---|---|---|
A high performance hierarchical cubing algorithm and efficient OLAP in high-dimensional data warehouse |
Abstract | ||
|---|---|---|
Data cube has been playing an essential role in fast OLAP (online analytical processing) in many data warehouses. The pre-computation of data cubes is critical for improving the OLAP response time of in large high-dimensional data warehouses. However, as the sizes of data warehouses grow, the time it takes to perform this pre-computation becomes a significant performance bottleneck. In a high dimensional data warehouse, it might not be practical to build all these cuboids and their indices. In this paper, we propose a hierarchical cubing algorithm to partition the high dimensional data cube into low dimensional cube segments. It permits a significant reduction of CPU and I/O overhead for many queries by restricting the number of cube segments to be processed for both the fact table and bitmap indices. Experimental results show that the proposed method is significantly more efficient than other existing cubing methods. |
Year | Venue | Keywords |
|---|---|---|
2007 | PAKDD Workshops | large high-dimensional data warehouse,data warehouse,hierarchical cubing algorithm,olap response time,high dimensional data warehouse,low dimensional cube segment,efficient olap,high performance,high dimensional data cube,data cube,existing cubing method,cube segment,fast olap,high dimensional data |
Field | DocType | Volume |
Data warehouse,Data mining,Bottleneck,Clustering high-dimensional data,Fact table,Computer science,Algorithm,Bitmap,Online analytical processing,Data cube,Cube | Conference | 4819 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-77016-X | 0 |
PageRank | References | Authors |
0.34 | 11 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kongfa Hu | 1 | 38 | 9.26 |
| Zhenzhi Gong | 2 | 3 | 1.13 |
| Qingli Da | 3 | 299 | 17.21 |
| Ling Chen | 4 | 217 | 29.30 |