Skip to Main content Skip to Navigation
Journal articles

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 metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : viet phanluong Connect in order to contact the contributor
Submitted on : Friday, May 18, 2018 - 10:54:47 PM
Last modification on : Thursday, July 14, 2022 - 4:07:20 AM
Long-term archiving on: : Tuesday, September 25, 2018 - 2:59:34 PM


Files produced by the author(s)


  • HAL Id : hal-01796028, version 1



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⟩



Record views


Files downloads