ECM - École Centrale de Marseille : UMR7279 (Pôle de l'étoile - Technopole de Château-Gombert - 38 rue Frédéric Joliot-Curie - 13013 Marseille - France)
2AMU - Aix Marseille Université (Aix-Marseille Université
Jardins du Pharo
58 Boulevard Charles Livon
13284 Marseille cedex 7 - France)
Abstract : —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;
https://hal-amu.archives-ouvertes.fr/hal-01796026 Contributor : Viet PhanluongConnect in order to contact the contributor Submitted on : Saturday, June 2, 2018 - 7:13:15 PM Last modification on : Wednesday, November 3, 2021 - 9:38:42 AM Long-term archiving on: : Monday, September 3, 2018 - 3:54:23 PM
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⟩