This Article 
 Bibliographic References 
 Add to: 
A Wavelet Framework for Adapting Data Cube Views for OLAP
May 2004 (vol. 16 no. 5)
pp. 552-565

Abstract—This article presents a method for adaptively representing multidimensional data cubes using wavelet view elements in order to more efficiently support data analysis and querying involving aggregations. The proposed method decomposes the data cubes into an indexed hierarchy of wavelet view elements. The view elements differ from traditional data cube cells in that they correspond to partial and residual aggregations of the data cube. The view elements provide highly granular building blocks for synthesizing the aggregated and range-aggregated views of the data cubes. We propose a strategy for selectively materializing alternative sets of view elements based on the patterns of access of views. We present a fast and optimal algorithm for selecting a nonexpansive set of wavelet view elements that minimizes the average processing cost for supporting a population of queries of data cube views. We also present a greedy algorithm for allowing the selective materialization of a redundant set of view element sets which, for measured increases in storage capacity, further reduces processing costs. Experiments and analytic results show that the wavelet view element framework performs better in terms of lower processing and storage cost than previous methods that materialize and store redundant views for online analytical processing (OLAP).

[1] E.F. Codd, S.B. Codd, and C.T. Salley, Providing OLAP (On-Line Analytical Processing) to User-Analysts: An IT Mandate technical report, E.F. Codd&Assoc., 1993.
[2] J. Gray, A. Bosworth, A. Layman, and H. Pirahesh, Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals Proc. Int'l Conf. Database Eng. (ICDE), pp. 152-159, 1996.
[3] J.R. Smith, V. Castelli, A. Jhingran, and C.-S. Li, Dynamic Assembly of Views in Data Cubes Proc. ACM Principles of Database Systems (PODS), pp. 274-283, June 1998.
[4] J.S. Vitter, M. Wang, and B. Iyer, Data Cube Approximation and Histograms via Wavelets Proc. ACM Int'l Conf. Information and Knowledge Management (CIKM), pp. 96-104, Nov. 1998.
[5] K.A. Ross and D. Srivastava, Fast Computation of Sparse Datacubes Proc. Conf. Very Large Databases (VLDB), pp. 116-125, 1997.
[6] H. Gupta, V. Harinarayan, A. Rajaramana, and J. Ullman, Index Selection for OLAP Proc. 13th Int'l Conf. Data Eng., 1997.
[7] V. Harinarayan, A. Rajaraman, and J.D. Ullman, Implementing Data Cubes Efficiently ACM Proc. Int'l Conf. Management Data (SIGMOD), pp. 205-216, 1996.
[8] R. Agrawal, A. Gupta, and S. Sarawagi, Modeling Multidimensional Databases Proc. Int'l Conf. Database Eng. (ICDE), pp. 232-243, Apr. 1997.
[9] S. Agrawal, R. Agrawal, P.M Deshpande, A. Gupta, J.E. Naughton, R. Ramakrishnan, and S. Sarawagi, On the Computation of Multidimensional Aggregates Proc. Conf. Very Large Databases (VLDB), pp. 506-521, 1996.
[10] C.-T. Ho, R. Agrawal, N. Megiddo, and R. Srikant, Range Queries in OLAP Data Cubes Proc. ACM Int'l Conf. Management Data (SIGMOD), pp. 73-88, May 1997.
[11] C. Dyreson, Information Retrieval from an Incomplete Data Cube Proc. Conf. Very Large Databases (VLDB), pp. 532-543, Apr. 1996.
[12] Y. Zhao, P. M. Deshpande, J. F. Naughton, An Array-Based Algorithm for Simlutaneous Multidimensional Aggregates Proc. ACM Int'l Conf. Management Data (SIGMOD), pp. 159-170, 1997.
[13] M. Vetterli and J. Kovavcevic, Wavelets and Subband Coding. Englewood Cliffs, N.J.: Prentice-Hall, Inc., 1995.
[14] I. Daubechies, Ten Lectures on Wavelets CBMS-NSF Regional Conf. Series in Applied Math. Soc. for Industrial and Applied Math., 1992.
[15] J.R. Smith and S. Chang, “Transform Features For Texture Classification and Discrimination in Large Image Databases,” Proc. IEEE Int'l Conf. Image Processing, pp. 407-411, 1994.
[16] J.R. Smith, VideoZoom Spatio-Temporal Video Browser IEEE Trans. Multimedia, vol. 1, no. 2, pp. 157-171, June 1999.
[17] J.R. Smith and C.-S. Li, An Adaptive View Element Framework for Multi-Dimensional Data Management Proc. ACM Int'l Conf. Information and Knowledge Management (CIKM), pp. 308-315, Nov. 1999.
[18] P.J. Burt and E.H. Adelson, “The Laplacian Pyramid as a Compact Image Code,” IEEE Trans. Comm., vol. 31, no. 4, pp. 532-540, 1983.
[19] R.R. Coifman and M.V. Wickerhauser, "Entropy Based Algorithms for Best Basis Selection," IEEE Trans. Information Theory, vol. 38, pp. 713-718, 1992.
[20] J.R. Smith and S.-F. Chang, Joint Adaptive Space and Frequency Graph Basis Selection Proc. IEEE Int'l Conf. Image Processing (ICIP), pp. 702-705, Oct. 1997.

Index Terms:
Databases, multidimensional data management, decision support, data organization, data cubes, wavelets, OLAP.
John R. Smith, Chung-Sheng Li, Anant Jhingran, "A Wavelet Framework for Adapting Data Cube Views for OLAP," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 5, pp. 552-565, May 2004, doi:10.1109/TKDE.2004.1277817
Usage of this product signifies your acceptance of the Terms of Use.