The use of B*- trees to create and calculate OLAP cubes using a combinatorial algorithm
DOI:
https://doi.org/10.15587/2312-8372.2013.18216Keywords:
OLAP, multidimensional cube, fact table, dimension table, B*- tree, level of detail, combination, aggregationAbstract
The paper considers the approach to building a multidimensional OLAP cube in the form of B*- tree structure, and the algorithm of its creation, using a combinatorial approach to the calculation of aggregate values of the cube. The main objective of research is to develop the methods of effective materialization of OLAP-cubes for further integration with the models and methods of Data Mining. The proposed storage structure of multidimensional data allows solving the problem of data irrelevance; it is suitable for both dense and sparse cubes, and the proposed algorithm allows efficient calculation of aggregate values of the OLAP cube. The research results can be applied in various fields, which use database management systems, as well as in decision support systems, using the methods of business intelligence.
References
- Барсегян, А. А. Методы и модели анализа данных: OLAP и Data Mining [Текст] / А. А. Барсегян, М. С. Куприянов, В. В. Степаненко, И. И. Холод. – СПБ: БХВ-Петербург, 2004. – 336 с.
- Паклин, Н. Б. Бизнес-аналитика: от данных к знаниям [Текст] : учеб. пособ. / Н. Б. Паклин, В. И. Орешков. – 2-е изд. – СПб.: Питер, 2010. – 704 с.
- Харинатх С., Куинн С. SQL Server 2005 Analysis Services и MDX для профессионалов.: Пер. с англ. – М.: ООО «И.Д. Вильямс», 2008. – 848 с.
- Архипенков С. ORACLE Express OLAP. М.: Диалог МИФИ, 2000,320 с.
- Кудрявцев, Ю. А. OLAP технологии: обзор решаемых задач и исследований [Текст] / Ю. А. Кудрявцев // Бизнес-информатика. – 2008. – №1. – С. 66-70.
- Sismanis, Ya. Dwarf: Shrinking the petacube [Text] / Yannis Sismanis, Antonios Deligiannakis, Nick Roussopoulos, Yannis Kotidis. – In VLDB, 2002.
- Zhao, Y. An array-based algorithm for simultaneous multidimensional aggregates [Text] / Yihong Zhao, Prasad M. Deshpande, Jeffrey F. Naughton // In SIGMOD. – 1997. – pp. 159-170.
- Иванчева, Н. А. Постреляционная СУБД Cache [Текст] / Н. А. Иванчева, Т. А. Иванчева. – Новосибирск: Новосибирский государственный университет, 2004. – 120 с.
- Кормен, Т. Алгоритмы: построение и анализ [Текст]: пер. с англ / Т. Кормен и др. – 2-е изд. – М.: Издательский дом «Вильямс», 2005. – 1296 с.
- Липский, В. Комбинаторика для программистов [Текст] / В. Липский. – М.: Мир, 1988. – 200 с.
- Barsegjan, A. A., Kuprijanov, M. S., Stepanenko, V. V., Holod, I. I. (2004). Metody i modeli analiza dannyh: OLAP i Data Mining. SPB: BHV-Peterburg, 336.
- Paklin, N. B., Oreshkov, V. I. (2010). Biznes-analitika: ot dannyh k znanijam: Uchebnoe posobie. Ed. 2. SPb.: Piter, 704.
- Harinath S., Kuinn S. (2008). SQL Server 2005 Analysis Services i MDX dlja professionalov.: Per. s angl. – M.: OOO «I.D. Vil'jams», 2008, 848.
- Arhipenkov S. (2000). ORACLE Express OLAP. M.: Dialog MIFI, 320.
- Kudrjavcev, Ju. A. (2008). OLAP tehnologii: obzor reshaemyh zadach i issledovanij. Biznes-informatika, 1, 66-70.
- Yannis Sismanis, Antonios Deligiannakis, Nick Roussopoulos, Yannis Kotidis. (2002). Dwarf: Shrinking the petacube. In VLDB.
- Yihong Zhao, Prasad M. Deshpande, Jeffrey F. Naughton. (1997). An array-based algorithm for simultaneous multidimensional aggregates. In SIGMOD, 159-170.
- Ivancheva, N. A., Ivancheva, T. A. (2004). Postreljacionnaja SUBD Cache. Novosibirsk: Novosibirskij gosudarstvennyj universitet, 120.
- Kormen, T. and others. (2005). Algoritmy: postroenie i analiz. Ed. 2. M.: Izdatel'skij dom «Vil'jams», 1296.
- Lipskij,V. (1988). Kombinatorika dlja programmistov. M.: Mir, 200.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2016 Гліб Валентинович Горбань
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.