Lossless Reduction of Datacubes using Partitions

View Sample PDF

Author(s): Alain Casali (Aix-Marseille Universités, France), Sébastien Nedjar (Aix-Marseille Universités, France), Rosine Cicchetti (Aix-Marseille Universités, France), Lotfi Lakhal (Aix-Marseille Universités, France) and Noël Novelli (Aix-Marseille Universités, France)
Copyright: 2009
Volume: 5
Issue: 1
Pages: 18
Source title: International Journal of Data Warehousing and Mining (IJDWM)
Editor(s)-in-Chief: David Taniar (Monash University, Australia)
DOI: 10.4018/jdwm.2009010102

Keywords: Data Mining / Data Mining and Databases / Information Science Reference / Library & Information Science

Purchase

View Lossless Reduction of Datacubes using Partitions on the publisher's website for pricing and purchasing information.

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.

The IRMA Community

Research IRM

Lossless Reduction of Datacubes using Partitions

Purchase

Abstract

Related Content

IRMA Sponsors