Concise (or condensed) representations of frequent patterns follow the minimum description
length (MDL) principle, by providing the shortest description of the whole set of frequent …

The last years witnessed an explosive progress in networking, storage, and processing
technologies resulting in an unprecedented amount of digitalization of data. Hence, there …

Data cubes capture general trends aggregated from multidimensional data from a
categorical relation. When provided with two relations, interesting knowledge can be …

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 …

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 …

We call a base of data cubes a structure that allows to compute data cube query. In a
previous work, we have presented a compact index base, called the first-half index base …

The high definition video adoption has been growing rapidly for the last two years. The two
high definition DVD formats HD-DVD and Blueray have mandated MPEG-2, H. 264 and VC …

In business intelligence, the concept of data cube offers aggregate views over multiple
dimensions of business. Computing the data cube is a challenge because of the exponential …

Given a relational fact table R, we call a base of data cubes on R a structure that allows to
query the data cubes with any aggregate function. This work presents a compact base of …

—This paper presents a simple approach to represent data cubes that allows efficient
computing, querying and updating. The representation is based on (i) a recursive …