Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Searching Data Cube for Submerging and Emerging Cuboids

Abstract : —Many existing approaches to data cube computation search for the group-by partitions on fact table with support greater than some threshold, that is, those can be obtained from the SQL group-by queries with the clause HAVING COUNT(*) >= supp, where supp is a support threshold. Those partitions constitute what is called the iceberg data cube. The present work proposes an efficient method to compute the similar partitions, but in contrast to those previous approaches, in the clause HAVING, COUNT(*) can be >= supp or < supp. Generally, the method can search for the partitions that can be in the emerging part or in the submerging part of data cube, and on any other aggregate functions, not only the function COUNT.
Document type :
Conference papers
Complete list of metadata
Contributor : viet phanluong Connect in order to contact the contributor
Submitted on : Saturday, June 2, 2018 - 7:06:01 PM
Last modification on : Sunday, June 26, 2022 - 10:27:37 AM
Long-term archiving on: : Monday, September 3, 2018 - 3:38:10 PM


Files produced by the author(s)




Viet Phan-Luong. Searching Data Cube for Submerging and Emerging Cuboids. 2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA), Mar 2017, Taipei, France. ⟨10.1109/AINA.2017.77⟩. ⟨hal-01796021⟩



Record views


Files downloads