Computation of Sparse Data Cubes with Constraints

  • Changqing Chen
  • Jianlin Feng
  • Longgang Xiang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2737)


For a data cube there are always constraints between dimensions or between attributes in a dimension, such as functional dependencies. We introduce the problem that when there are functional dependencies, how to use them to speed up the computation of sparse data cubes. A new algorithm CFD is presented to satisfy this demand. CFD determines the order of dimensions by considering their cardinalities and functional dependencies between them together. It makes dimensions with functional dependencies adjacent and their codes satisfy monotonic mapping, thus reduces the number of partitions for such dimensions. It also combines partitioning from bottom to up and aggregate computation from top to bottom to speed up the computation further. In addition CFD can efficiently compute a data cube with hierarchies from the smallest granularity to the coarsest one, and at most one attribute in a dimension takes part in the computation each time. The experiments have shown that the performance of CFD has a significant improvement.


Functional Dependency Recursive Call Data Cube Structural Sparsity Small Partition 
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.
    Baeyer, K., Ramakrishnan, R.: Bottom-Up Computation of Sparse and Iceberg CUBEs. In: SIGMOD 1999, pp. 359–370 (1999)Google Scholar
  2. 2.
    Ross, K.A., Strivastava, D.: Fast computation of sparse data cubes. In: Proc. Of the 23rd VLDB Conf., Athens, Green, pp. 116–125 (1997)Google Scholar
  3. 3.
    Agarwal, S., Agrawal, R., Desgpande, P.M., Gupta, A., Naughton, J.F., Ramakrishnan, R., Sarawagi, S.: On the computation of multidimensional aggregates. In: Proc. Of the 22nd VLDB Conf., pp. 506–521 (1996)Google Scholar
  4. 4.
    Niemi, T., Nummenmaa, J., Thanisch, P.: Constructing OLAP Cubes Based on Queries. In: DOLAP 2001, pp. 1–8 (2001)Google Scholar
  5. 5.
    Gray, J., Bosworth, A., Layman, A., Pirahesh, H.: Datacube: A relational aggregation operator generalizing group by, cross-tab, and sub-totals. In: ICDE 1996, pp. 152–159 (1996)Google Scholar
  6. 6.
    Zhao, Y., Desgpande, P.M., Naughton, J.F.: An array-based algorithm for simultaneous mutldimensional aggregates. In: SIGMOD 1997, pp. 159–170 (1997)Google Scholar
  7. 7.
    Wang, W., Feng, J., Lu, H., Yu, J.X.: Condensed Cube: An Effective Approach to Reducing Data Cube Size. In: Proc. of the 18th Int. Conf. on Data Engineering, pp. 155–165 (2002)Google Scholar
  8. 8.
    Sismanis, Y., Deligiannakis, A., Roussopoulos, N., Kotidis, Y.: Dwarf: Shrinking the PetaCube. In: SIGMOD 2002 (2002)Google Scholar
  9. 9.
    Han, J., Pei, J., Dong, G., Wang, K.: Efficient Computation of Iceberg Cubes with Complex Measures. In: SIGMOD 2001 (2001)Google Scholar
  10. 10.
    Lakshmanan, L., Pei, J., Han, J.: Quotient Cube: How to Summarize the Semantics of a Data CubeFast. In: Proc. the 28rd VLDB Conference, HongKong, China (2002)Google Scholar
  11. 11.
    Lenher, W., Albrecht, J., Wedekind, H.: Normal forms for multidimensional databases. In: Rafanelli, M., Svensson, P., Klensin, J.C. (eds.) SSDBM 1988. LNCS, vol. 339, pp. 63–72. Springer, Heidelberg (1989)Google Scholar
  12. 12.
    Hahn, C., Warren, S., London, J.: Edited synoptic cloud reports from ships and land stations over the globe (1982-1991) (1994),,

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Changqing Chen
    • 1
  • Jianlin Feng
    • 2
  • Longgang Xiang
    • 2
  1. 1.School of SoftwareHuazhong Univ. of Sci. & Tech.Wuhan, HubeiChina
  2. 2.School of Computer ScienceHuazhong Univ. of Sci. & Tech.Wuhan, HubeiChina

Personalised recommendations