On complexity of reduction of multidimensional data models

In this paper decomposition methods for multidimensional data hypercubes of OLAP-systems are studied. The criteria for reducing the computational complexity of the decomposition methods are presented and comparisons have made to the traditional solutions of multidimensional data analysis problems. The examples of application of these criteria in the study of the dynamics of computational complexity changes for the specific types of reduction problems have been considered.