Abstract
In 1993, E. Codd introduced a concept of an OLAP (online analytical processing) system, which includes 12 rules of representing data for the user. As can be seen from the name, such systems are designed for analyzing data in an interactive mode. Hence, the basic goal of OLAP means is to represent large amount of data in the form convenient for the end-user analysis. Currently, the representation of data in the form of multidimensional cubes is a de facto standard of user work with large amount of data. In this paper, basic concepts of the OLAP systems are introduced and, then, formalized in terms of the lattice theory. In the frame-work of this formalization, the optimality (in terms of the amount of data stored) of the representation of the OLAP cubes by closed lattices or by quotient lattices (which are equivalent to the former) is proved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Codd, E.F., Providing OLAP for End-user Analysis: An IT Mandate, ComputerWorld, 1993.
Pendse, N., Olareport: What is olap?, 2005.
Gray, J., Bosworth, A., Layman, A., and Pirahesh, H., Data Cube: A Relational Aggregation Operator Generalizing group-by, cross-tab, and sub-totals, Microsoft Lab, 1995.
Thomsen, E., OLAP Solutions: Building Multidimensional Information Systems, Wiley, 2002, 2nd ed.
Goil, S. and Choudhary, A., High Performance OLAP and Data Mining on Parallel Computers, Technical Report TR-97-05, Center of Parallel and Distributed Computing, 1997.
Grätzer, G., General Lattice Theory, Berlin: Springer, 1978. Translated under the title Obshchaya teoriya reshetok, Moscow: Mir, 1982.
Casali, A., Mining Borders of the Difference of Two Datacubes, DaWaK, 2004.
Nedjar, S., Casali, A., Cicchetti, R., and Lakhal, L., Emerging Cubes for Trends Analysis in Olapdatabases, Lecture Notes in Computer Science, 2007, vol. 4654, pp. 135–144.
Yan Zhao, Quotient Cube and QC-Tree: Efficient Summarizations for Semantic Olap, 2003.
Pedersen, T.B., Jensen, C.S., and Dyreson, C.E., A Foundation for Capturing and Querying Complex Multidimensional Data, Inf. Syst., 2001, vol. 26, no. 5, pp. 383–423.
Multidimensional Databases: Problems and Solutions, Rafanelli, M., Ed., Idea Group, 2003.
Ge Yang, Ruoming Jin, and Gagan Agrawal, Implementing Data Cube Construction Using a Cluster Middleware: Algorithms, Implementation Experience, and Performance Evaluation, Future Gener. Comput. Syst., 2003, vol. 19, no. 4, pp. 533–550.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © S.D. Kuznetsov, Yu.A. Kudryavtsev, 2009, published in Programmirovanie, 2009, Vol. 35, No. 5.
Rights and permissions
About this article
Cite this article
Kuznetsov, S.D., Kudryavtsev, Y.A. A mathematical model of the OLAP cubes. Program Comput Soft 35, 257–265 (2009). https://doi.org/10.1134/S0361768809050028
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0361768809050028