Lossless Reduction of Datacubes using Partitions

Abstract : Datacubes are especially useful for answering efficiently queries on data warehouses. Nevertheless the amount of generated aggregated data is huge with respect to the initial data which is itself very large. Recent research has addressed the issue of a summary of Datacubes in order to reduce their size. The approach presented in this paper fits in a similar trend. We propose a concise representation, called Partition Cube, based on the concept of partition and we give a new algorithm to compute it. We propose a Relational Partition Cube, a novel ROLAP cubing solution for managing Partition Cubes using the relational technology. Analytical evaluations show that the storage space of Partition Cubes is smaller than Datacubes. In order to confirm analytical comparison, experiments are performed in order to compare our approach with Datacubes and with two of the best reduction methods, the Quotient Cube and the Closed Cube.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00464157
Contributor : Sébastien Nedjar <>
Submitted on : Tuesday, March 16, 2010 - 11:06:52 AM
Last modification on : Friday, March 9, 2018 - 11:24:55 AM

Identifiers

Collections

Citation

Alain Casali, Sébastien Nedjar, Rosine Cicchetti, Lotfi Lakhal, Noël Novelli. Lossless Reduction of Datacubes using Partitions. International Journal of Data Warehousing and Mining, 2009, 5 (1), pp.18-35. ⟨10.4018/ijdwm.2009010102⟩. ⟨hal-00464157⟩

Share

Metrics

Record views

117