Multidimensional models: constructing data CUBE

  • Authors:
  • Antoaneta Ivanova;Boris Rachev

  • Affiliations:
  • TU-Varna;TU-Varna

  • Venue:
  • CompSysTech '04 Proceedings of the 5th international conference on Computer systems and technologies
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The goal of this article is to depict algorithms and new approach of creating data cube efficiently and to set tasks for future work. In short, the paper has described it as a data abstraction that allows one to view aggregated data from a number of perspectives: 1) Conceptually, the cube consists of a base cuboid, surrounded by a collection of sub-cubes that represent the aggregation of the base cuboid along one or more dimensions; 2) The basic methods for computing a group-by: sort-based and hash-based. 3) Dynamic Data Cube, which provide efficient performance and allows for the data cube expansion in any direction. 4) OO Conceptual Model Data Cube - class definition of data cube.