OLAP Data Cube Compression Techniques: A Ten-Year-Long History

  • Alfredo Cuzzocrea
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6485)


OnLine Analytical Processing (OLAP) is relevant for a plethora of Intelligent Data Analysis and Mining Applications and Systems, as it offers powerful tools for exploring, querying and mining massive amounts of data on the basis of fortunate and well-consolidated multidimensional and a multi-resolution metaphors over data. Applicative settings for which OLAP plays a critical role are manyfold, and span from Business Intelligence to Complex Information Retrieval and Sensor and Stream Data Analysis. Recently, the Database and Data Warehousing research community has experienced an explosion of OLAP-related methodologies and techniques aimed at improving the capabilities and the opportunities of complex mining processes over heterogeneous-in-nature, inter-related and massive data repositories. Despite this, open problems still arise, among which the so-called curse of dimensionality problem plays a major role. This problem refers to well-understood limitations of state-of-the-art OLAP data processing techniques in elaborating, querying and mining multidimensional data when data cubes grow in size and dimension number. This evidence has originated a large spectrum of research efforts in the context of Approximate OLAP Query Answering techniques, whose main idea consists in compressing target data cubes in order to originate compressed data structures able of retrieving approximate answers to OLAP queries at a tolerable query error. This research proposes an excerpt of a ten-year-long history of OLAP data cube compression techniques, by particularly focusing on three major results, namely Δ− Syn, K LSA and \(\mathcal{LCS}-Hist\).


Little Square Approximation Business Intelligence Data Cube Multidimensional Data Approximate Answer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Berchtold, S., Bhm, C., Kriegel, H.-P.: The pyramid-technique: Towards breaking the curse of dimensionality. In: Proceedings of the 1998 International Conference on Management of Data (SIGMOD 1998), pp. 142–153 (1998)Google Scholar
  2. 2.
    Cuzzocrea, A.: Overcoming limitations of approximate query answering in olap. In: Proceedings of the 9th International Symposium on Database Engineering and Applications (IDEAS 2005), pp. 200–209 (2005)Google Scholar
  3. 3.
    Cuzzocrea, A.: Accuracy control in compressed multidimensional data cubes for quality of answer-based olap tools. In: Proceedings of the 18th International Conference on Scientific and Statistical Database Management (SSDBM 2006), pp. 301–310 (2006)Google Scholar
  4. 4.
    Cuzzocrea, A.: Improving range-sum query evaluation on data cubes via polynomial approximation. Data & Knowledge Engineering 56(2), 85–121 (2006)CrossRefGoogle Scholar
  5. 5.
    Cuzzocrea, A., Serafino, P.: LCS-hist: Taming massive high-dimensional data cube compression. In: Proceedings of the 12nd International Conference on Extending Database Technology (EDBT 2009), pp. 768–779 (2009)Google Scholar
  6. 6.
    Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, A., Pellow, F., Pirahesh, H.: Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Mining and Knowledge Discovery 1(1), 29–53 (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Alfredo Cuzzocrea
    • 1
  1. 1.ICAR-CNR and University of CalabriaRendeItaly

Personalised recommendations