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 metadatas

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

File

PID4629151.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

154

Files downloads

191