On the Complexity of the Reduction of Multidimensional Data Models
| العنوان: | On the Complexity of the Reduction of Multidimensional Data Models |
|---|---|
| المؤلفون: | V. Z. Rakhmankulov, K. V. Yuzhanin, A. A. Akhrem |
| المصدر: | Scientific and Technical Information Processing. 44:406-411 |
| بيانات النشر: | Allerton Press, 2017. |
| سنة النشر: | 2017 |
| مصطلحات موضوعية: | Multidimensional analysis, Theoretical computer science, General Computer Science, Computational complexity theory, Computer science, Online analytical processing, 010102 general mathematics, Multidimensional data, 02 engineering and technology, 01 natural sciences, Reduction (complexity), 0202 electrical engineering, electronic engineering, information engineering, Decomposition (computer science), 020201 artificial intelligence & image processing, Hypercube, 0101 mathematics |
| الوصف: | 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. |
| تدمد: | 1934-8118 0147-6882 |
| DOI: | 10.3103/s0147688217060028 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::927545a82c002eecedb88af6f7eaa47f https://doi.org/10.3103/s0147688217060028 |
| Rights: | CLOSED |
| رقم الانضمام: | edsair.doi...........927545a82c002eecedb88af6f7eaa47f |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 19348118 01476882 |
|---|---|
| DOI: | 10.3103/s0147688217060028 |