A Simple Data Cube Representation for Efficient Computing and Updating

Viet Phanluong (1)

1 LIS - Laboratoire d'Informatique et Systèmes

—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.

Keywords: articleid: 15001 title: A Simple Data Cube Representation for Efficient Computing and Updating keywords: Data warehouse; Data mining; Data cube; Data cube update; –Data warehouse

Domains: Computer Science [cs]; Databases [cs.DB]

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⟩