Cubes convexes

Abstract : In various approaches, data cubes are pre-computed in order to answer efficiently OLAP queries. The notion of data cube has been declined in various ways: iceberg cubes, range cubes or differential cubes. In this paper, we introduce the concept of convex cube which captures all the tuples of a datacube satisfying a constraint combination. It can be represented in a very compact way in order to optimize both computation time and required storage space. The convex cube is not an additional structure appended to the list of cube variants but we propose it as a unifying structure that we use to characterize, in a simple, sound and homogeneous way, the other quoted types of cubes. Finally, we introduce the concept of emerging cube which captures the significant trend inversions. characterizations.
Document type :
Journal articles
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00464232
Contributor : Sébastien Nedjar <>
Submitted on : Thursday, March 25, 2010 - 7:35:48 PM
Last modification on : Friday, March 9, 2018 - 11:25:30 AM
Long-term archiving on : Tuesday, September 28, 2010 - 12:20:29 PM

Files

isi2006_NEDJAR.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Sebastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal. Cubes convexes. Revue des Sciences et Technologies de l'Information - Série ISI : Ingénierie des Systèmes d'Information, Lavoisier, 2006, 11 (6), pp.11-31. ⟨10.3166/isi.11.6.11-31⟩. ⟨hal-00464232⟩

Share

Metrics

Record views

179

Files downloads

189