Photo from wikipedia
In this paper, decomposition methods for multidimensional data hypercubes of OLAP systems are investigated. Criteria for reducing the computational complexity of the decomposition methods are presented and comparisons are made… Click to show full abstract
In this paper, decomposition methods for multidimensional data hypercubes of OLAP systems are investigated. Criteria for reducing the computational complexity of the decomposition methods are presented and comparisons are made with the traditional solutions of multidimensional data analysis problems. Examples illustrating the application of these criteria to investigating the dynamics of computational complexity changes for specific types of reduction problems are considered.
Keywords:
data models;
complexity;
reduction multidimensional;
multidimensional data;
complexity reduction
Journal Title: Scientific and Technical Information Processing
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Scientific and Technical Information Processing
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!