Constrained closed non derivable data cube - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Constrained closed non derivable data cube

Résumé

It is well recognized that data cubes often produce huge outputs. Several efforts were devoted to this problem through Constrained Cubes allowing the user to focus on a particular set of interesting tuples. In this paper, we investigate reduced representations for the Constrained Cube (e.g., Constrained Closed Cube and Constrained Quotient Cube). That is why we introduce a new and concise representation of data cubes: the Constrained Closed Non Derivable Data Cube (CCND-Cube). The latter captures all the tuples of a data cube fulfilling a combination of monotone/anti-monotone constraints. It can be represented in a very compact way in order to optimize both computation time and required storage space. The results of our experiments confirm the relevance of our proposal
Fichier non déposé

Dates et versions

hal-01299251 , version 1 (07-04-2016)

Identifiants

Citer

Hanen Brahmi, Sadok Ben Yahia. Constrained closed non derivable data cube. ADMA 2012 : 8th International Conference on Advanced Data Mining and Applications, Dec 2012, Nanjing, China. pp.766 - 778, ⟨10.1007/978-3-642-35527-1_63⟩. ⟨hal-01299251⟩
35 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More