A Data Cube Representation for Efficient Querying and Updating - Aix-Marseille Université Access content directly
Conference Papers Year : 2016

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;
Fichier principal
Vignette du fichier
PID4560247.pdf (114.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01796026 , version 1 (02-06-2018)

Identifiers

  • HAL Id : hal-01796026 , version 1

Cite

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⟩
74 View
197 Download

Share

Gmail Facebook X LinkedIn More