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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal-amu.archives-ouvertes.fr/hal-01796028
Contributor : Viet Phanluong <>
Submitted on : Friday, May 18, 2018 - 10:54:47 PM
Last modification on : Wednesday, May 30, 2018 - 1:20:00 AM
Long-term archiving on: Tuesday, September 25, 2018 - 2:59:34 PM

File

inno2jrnal_rev-phan.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01796028, version 1

Collections

Citation

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

Share

Metrics

Record views

35

Files downloads

21