A Data Cube Representation for Efficient Querying and Updating

Viet Phan-Luong (1, 2)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille
2 AMU - Aix Marseille Université

—This paper presents an approach to data cube representation that allows for efficient computation of query response and data cube update. The representation is based on (i) a recursive construction of the power set of the fact table dimension scheme and (ii) a prefix tree structure for the compact storage of cuboids. Experimental results on large datasets show that the approach is efficient for data cube query and incremental update. Keywords-data warehouse; data cube; data mining;

Domaines: Base de données [cs.DB]

Viet Phan-Luong. A Data Cube Representation for Efficient Querying and Updating. 2016 International Conference on Computational Science and Computational Intelligence, Dec 2016, Las Vegas, Nevada, USA, United States. ⟨hal-01796026⟩