Skip to Main content Skip to Navigation
Conference papers

A Data Cube Representation for Efficient Querying and Updating

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;
Document type :
Conference papers
Complete list of metadatas

https://hal-amu.archives-ouvertes.fr/hal-01796026
Contributor : Viet Phanluong <>
Submitted on : Saturday, June 2, 2018 - 7:13:15 PM
Last modification on : Thursday, January 23, 2020 - 6:22:10 PM
Long-term archiving on: : Monday, September 3, 2018 - 3:54:23 PM

File

PID4560247.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01796026, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

107

Files downloads

194