Optimizing OLAP Queries by Mapping Data Cube to Two Dimensional Space
Subject Areas : electrical and computer engineeringm.k. sohraby 1 , Ahmad Abdollahzadeh Barforoush 2
1 -
2 - Amirkabir
Keywords: Data warehouseon-line analytical processing (OLAP)multi-dimensional data modeldata cube,
Abstract :
Data warehouse and OLAP are essential elements of decision support systems (DSS) and have been studied in database issues extensively. The requirements of decision support systems are different from on-line transactional processing systems. Query optimization and efficient data cube computation have primary roles in improving functionality of DSS. This paper presents a new method for query processing in data warehouses and computing data cubes using bottom-up cube computation techniques. Results of implementation show that the proposed algorithm outperforms two best known algorithms (based on time criterion), and is much faster than them in answering to monotonic query with large volume of data. Furthermore, 2-dimensional view of ex-cube and transforming the data cube to a hyper graph structure, reduce the required space of the algorithm when we aggregate subsets of cube's dimension.
[1]R. Kimball,The Data Warehouse Toolkit, John Wiley and Sons,Inc, 1996.
[2]J. Gray, A. Bosworth, A. Layman, and H. Pirahesh, "Datacube: arelational aggregation operator generalizing group-by, cross-tab, andsub-totals," inProc. of the IEEE ICDE, pp. 152-159, 1996.
[3]S. Agarwal, R. Agrawal, P. M. Deshpande, A. Gupta, J. F.Naughton, R. Ramakrishnan, and S. Sarawagi,On the omputation of Multidimensional Aggregates, VLDB’1996.
[4]K. Beyer and R. Ramakrishnan, "Bottom-up computation of sparse and iceberg cubes", in Proc. SIGMOD Conf., pp. 359-370, 1999.
[5]R. Agrawal and R. Srikant, Fast Algorithms for Mining AssociationRules, VLDB’1994.
[6]K. A. Ross and D. Srivastava, "Fast computation of sparse datacubes," in Proc. of the 23rd VLDB Conf., pp. 116-125, Athens,Greece, 1997.
[7]M. Laporte, N. Novelli, R. Cicchetti, and L. Lakhal,Computation Full and Iceberg Data Cubes Using Partitions, 2002.