Regression Cubes with Lossless Compression and Aggregation

Authors

Yixin Chen
Guozhu Dong, Wright State University - Main CampusFollow
Jiawei Han
Jian Pei
Benjamin W. Wah
Jianyong Wang

Document Type

Article

Publication Date

12-2006

Abstract

As OLAP engines are widely used to support multidimensional data analysis, it is desirable to support in data cubes advanced statistical measures, such as regression and filtering, in addition to the traditional simple measures such as count and average. Such new measures will allow users to model, smooth, and predict the trends and patterns of data. Existing algorithms for simple distributive and algebraic measures are inadequate for efficient computation of statistical measures in a multidimensional space. In this paper, we propose a fundamentally new class of measures, compressible measures, in order to support efficient computation of the statistical models. For compressible measures, we compress each cell into an auxiliary matrix with a size independent of the number of tuples. We can then compute the statistical measures for any data cell from the compressed data of the lower-level cells without accessing the raw data. Time- and space-efficient lossless aggregation formulae are derived for regression and filtering measures. Our analytical and experimental studies show that the resulting system, regression cube, substantially reduces the memory usage and the overall response time for statistical analysis of multidimensional data.

Repository Citation

Chen, Y., Dong, G., Han, J., Pei, J., Wah, B. W., & Wang, J. (2006). Regression Cubes with Lossless Compression and Aggregation. IEEE Transactions on Knowledge and Data Engineering, 18 (12).
https://corescholar.libraries.wright.edu/knoesis/324