IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Summarizing Datacubes: Semantic and Syntactic Approaches

Summarizing Datacubes: Semantic and Syntactic Approaches
View Sample PDF
Author(s): Rosine Cicchetti (Aix-Marseille Universités, France), Lotfi Lakhal (Aix-Marseille Universités, France), Sébastien Nedjar (Aix-Marseille Universités, France), Noël Novelli (Aix-Marseille Universités, France)and Alain Casali (Aix-Marseille Universités, France)
Copyright: 2011
Pages: 21
Source title: Integrations of Data Warehousing, Data Mining and Database Technologies: Innovative Approaches
Source Author(s)/Editor(s): David Taniar (Monash University, Australia)and Li Chen (LaTrobe University, Australia)
DOI: 10.4018/978-1-60960-537-7.ch002

Purchase

View Summarizing Datacubes: Semantic and Syntactic Approaches 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 work has addressed the issue of summarizing Datacubes in order to reduce their size. In this chapter, we present three different approaches. They propose structures which make it possible to reduce the size of the data cube representation. The two former, the closed cube and the quotient cube, are said semantic and discard the redundancies captured within data cubes. The size of the underlying representations is especially reduced but the counterpart is an additional response time when answering the OLAP queries. The latter approach is rather syntactic since it enforces an optimization at the logical level. It is called Partition Cube and based on the concept of partition. We also give an algorithm to compute it. We propose a Relational Partition Cube, a novel R-Olap cubing solution for managing Partition Cubes using the relational technology. An analytical evaluation shows 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.

Related Content

. © 2023. 34 pages.
. © 2023. 15 pages.
. © 2023. 15 pages.
. © 2023. 18 pages.
. © 2023. 24 pages.
. © 2023. 32 pages.
. © 2023. 21 pages.
Body Bottom