Computational Complexity Analysis of Decomposition Methods of OLAP Hyper-cubes of Multidimensional Data

Computational Complexity Analysis of Decomposition Methods of OLAP Hyper-cubes of Multidimensional Data

The paper investigates the problems of reduction (decomposition) of multidimensional data models in the form of hypercube OLAP structures. OLAP data processing does not allow changes in the dimension of space. With the increase in data volumes, the productivity of computing cubic structures decrease...

Full description

Bibliographic Details
Main Authors: A. A. Akhrem, A. P. Nosov, V. Z. Rakhmankulov, K. V. Yuzhanin
Format: Article
Language:Russian
Published: MGTU im. N.È. Baumana 2020-12-01
Series:Matematika i Matematičeskoe Modelirovanie
Subjects:
olap–systems
hypercube of multidimensional data
reduction methods
computational complexity
computational performance
Online Access:https://www.mathmelpub.ru/jour/article/view/221

Internet

https://www.mathmelpub.ru/jour/article/view/221

Similar Items