Pixelizing Data Cubes: a Block-Based Approach - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2007

Pixelizing Data Cubes: a Block-Based Approach

Yeow Wei Choong
  • Function : Author
  • PersonId : 838141
Anne Laurent

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.
Fichier principal
Vignette du fichier
43700063.pdf (597.89 Ko) Télécharger le fichier

Dates and versions

lirmm-00130712 , version 1 (13-02-2007)

Identifiers

  • HAL Id : lirmm-00130712 , version 1

Cite

Yeow Wei Choong, Anne Laurent, Dominique Laurent. Pixelizing Data Cubes: a Block-Based Approach. Visual Information Expert Workshop, 2007, Paris, pp.63-76. ⟨lirmm-00130712⟩
94 View
367 Download

Share

Gmail Facebook X LinkedIn More