Conference papers
A Simple and Efficient Method for Computing Data Cubes
Abstract : Based on a construction of the power set of the fact table schemes, this paper presents an approach to represent and to compute data cubes using a prefix tree structure for the storage of cuboids. Though the approach is simple, the experimental results show that it is efficient in run time and storage space.
Cited literature [21 references]
https://hal-amu.archives-ouvertes.fr/hal-01796032
Contributor : viet phanluong Connect in order to contact the contributor
Submitted on : Friday, May 18, 2018 - 11:09:35 PM
Last modification on : Sunday, June 26, 2022 - 10:15:51 AM
Long-term archiving on: : Monday, September 24, 2018 - 2:49:45 PM
Contributor : viet phanluong Connect in order to contact the contributor
Submitted on : Friday, May 18, 2018 - 11:09:35 PM
Last modification on : Sunday, June 26, 2022 - 10:15:51 AM
Long-term archiving on: : Monday, September 24, 2018 - 2:49:45 PM
File
innov_2015_3_40_70080.pdf
Publisher files allowed on an open archive