Open access research
publication repository
publication repository
Kaser, Owen, & Lemire, Daniel (2003). Attribute Value Reordering for Efficient Hybrid OLAP. In Rizzi, Stefano, & Song, Il-Yeol (Ed.), Proceedings of the ACM Sixth International Workshop on Data Warehousing and OLAP (p. 1-8). New Orleans, LA : ACM.
File(s) available for this item:| PDF - p19-kaser-nrc.pdf |
|
| Item Type: | Papers in Conference Proceedings |
|---|---|
| Refereed: | Yes |
| Status: | Published |
| Abstract: | The normalization of a data cube is the process of choosing an ordering for the attribute values, and the chosen ordering will affect the physical storage of the cube's data. For large multidimensional arrays, proper normalization can lead to more efficient storage in hybrid OLAP contexts that store dense and sparse chunks differently. We show that it is NP-hard to compute an optimal normalization even for 1x3 chunks, although we find an exact algorithm for 1x2 chunks. When attributes are nearly statistically independent, we show that an optimal normalization is given by dimension-wise attribute frequency sorting, which can be done in time O(d n log(n)) for data cubes of size n^d. When attributes are not independent, we propose and evaluate a number of heuristics. Our optimized hybrid OLAP storage mechanism was observed to be 44% more storage efficient than ROLAP and the gains due to normalization alone accounted for 45% of this increase in efficiency. |
| Depositor: | Lemire, Daniel |
| Owner / Manager: | Daniel Lemire |
| Deposited: | 27 Aug 2007 |
| Last Modified: | 16 Jul 2015 00:47 |
|
RÉVISER |
