Pixelizing Data Cubes: a Block-Based Approach

Abstract : Multidimensional databases are commonly used for decision making in the context of data warehouses. Considering the multidimensional model, data are presented as hypercubes organized according to several dimensions. How- ever, in general, hypercubes have more than three dimensions and contain a huge amount of data, and so cannot be easily visualized. In this paper, we show that data cubes can be visualized as images by building blocks that contain mostly the same value. Blocks are built up using an APriori-like algorithm and each block is considered as a set of pixels which colors depend on the corresponding value. The key point of our approach is to set how to display a given block according to its corresponding value while taking into account that blocks may overlap. In this paper, we address this issue based on the Pixelization paradigm.
Type de document :
Communication dans un congrès
PP. Lévy et al. Visual Information Expert Workshop, 2007, Paris, Springer-Verlag, pp.63-76, 2007, LNCS
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00130712
Contributeur : Anne Laurent <>
Soumis le : mardi 13 février 2007 - 14:59:20
Dernière modification le : jeudi 24 mai 2018 - 15:59:23
Document(s) archivé(s) le : mardi 6 avril 2010 - 23:51:52

Fichier

Identifiants

  • HAL Id : lirmm-00130712, version 1

Collections

Citation

Yeow Wei Choong, Anne Laurent, Dominique Laurent. Pixelizing Data Cubes: a Block-Based Approach. PP. Lévy et al. Visual Information Expert Workshop, 2007, Paris, Springer-Verlag, pp.63-76, 2007, LNCS. 〈lirmm-00130712〉

Partager

Métriques

Consultations de la notice

121

Téléchargements de fichiers

195