Compressing and Querying Skypattern Cubes - GREYC codag Access content directly
Conference Papers Year : 2019

Compressing and Querying Skypattern Cubes


Skypatterns are important since they enable to take into account user preference through Pareto-dominance. Given a set of measures, a skypattern query finds the patterns that are not dominated by others. In practice, different users may be interested in different measures, and issue queries on any subset of measures (a.k.a subspace). This issue was recently addressed by introducing the concept of skypattern cubes. However, such a structure presents high redundancy and is not well adapted for updating operations like adding or removing measures, due to the high costs of subspace computations in retrieving skypatterns. In this paper, we propose a new structure called Compressed Skypattern Cube (abbreviated CSKYC), which concisely represents a skypattern cube, and gives an efficient algorithm to compute it. We thoroughly explore its properties and provide an efficient query processing algorithm. Experimental results show that our proposal allows to construct and to query a CSKYC very efficiently.
Fichier principal
Vignette du fichier
84.pdf (566.86 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02190788 , version 1 (22-07-2019)



Willy Ugarte, Samir Loudni, Patrice Boizumault, Bruno Crémilleux, Alexandre Termier. Compressing and Querying Skypattern Cubes. IEA/AIE-2019 - 32nd International Conference on Industrial, Engineering & Other Applications of Applied Intelligent Systems, Jul 2019, Graz, Austria. pp.406-421, ⟨10.1007/978-3-030-22999-3_36⟩. ⟨hal-02190788⟩
158 View
112 Download



Gmail Mastodon Facebook X LinkedIn More