A Simple Data Cube Representation for Efficient Computing and Updating - Aix-Marseille Université Access content directly
Journal Articles International Journal On Advances in Intelligent Systems Year : 2016

A Simple Data Cube Representation for Efficient Computing and Updating

Abstract

—This paper presents a simple approach to represent data cubes that allows efficient computing, querying and updating. The representation is based on (i) a recursive construction of the power set of the scheme of the fact table and (ii) a prefix tree structure for the compact storage of cuboids. The experimental results on large real datasets show that the approach is efficient in run time, storage space, and for incremental update.
Fichier principal
Vignette du fichier
inno2jrnal_rev-phan.pdf (148.71 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01796028 , version 1 (18-05-2018)

Identifiers

  • HAL Id : hal-01796028 , version 1

Cite

Viet Phanluong. A Simple Data Cube Representation for Efficient Computing and Updating. International Journal On Advances in Intelligent Systems, 2016, pp.2016 - 2016. ⟨hal-01796028⟩
52 View
46 Download

Share

Gmail Mastodon Facebook X LinkedIn More