Hierarchical Datacubes

TL;DR

This paper introduces a comprehensive framework for hierarchical data cubes in data warehouses, emphasizing their formal definition, lattice structure, and a compact representation to optimize storage and query efficiency, especially in video game data.

Contribution

It provides a formal framework and a novel reduced representation for hierarchical data cubes, enhancing storage efficiency and query response in data warehouses.

Findings

Defined hierarchical data cube lattice.

Introduced the closed hierarchical data cube.

Optimized storage with reduced redundancy.

Abstract

Many approaches have been proposed to pre-compute data cubes in order to efficiently respond to OLAP queries in data warehouses. However, few have proposed solutions integrating all of the possible outcomes, and it is this idea that leads the integration of hierarchical dimensions into these responses. To meet this need, we propose, in this paper, a complete redefinition of the framework and the formal definition of traditional database analysis through the prism of hierarchical dimensions. After characterizing the hierarchical data cube lattice, we introduce the hierarchical data cube and its most concise reduced representation, the closed hierarchical data cube. It offers compact replication so as to optimize storage space by removing redundancies of strongly correlated data. Such data are typical of data warehouses, and in particular in video games, our field of study and experimentation, where hierarchical dimension attributes are widely represented.