Abstract
Datacubes are specially useful for answering efficiently queries on data warehouses. Nevertheless the amount of generated aggregated data is incomparably more voluminous than the initial data which is itself very large. Recently, research work has addressed the issue of a concise representation of datacubes in order to reduce their size. The approach presented in this paper fits in a similar trend. We propose a concise representation, called Partition Cube, based on the concept of partition and define an algorithm to compute it. Various experiments are performed in order to compare our approach with methods fitting in the same trend. This comparison relates to the efficiency of algorithms computing the representations, the main memory requirements, and the storage space which is necessary.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Beyer, K., Ramakrishnan, R.: Bottom-Up Computation of Sparse and Iceberg CUBEs. In: Proceedings of the International Conference on Management of Data, SIGMOD, pp. 359–370 (1999)
Casali, A., Cicchetti, R., Lakhal, L.: Extracting semantics from datacubes using cube transversals and closures. In: Proc. of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD, pp. 69–78 (2003)
Chaudhuri, S., Dayal, U.: An Overview of Data Warehousing and OLAP Technology. SIGMOD Record 26(1), 65–74 (1997)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
Gilbert, A., Kotidis, Y., Muthukrishnan, S., Strauss, M.: Surfing Wavelets on Streams: One-Pass Summaries for Approximate Queries. In: Proceedings of 27th International Conference on Very Large Data Bases, VLDB, pp. 79–88 (2001)
Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M., 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)
Gupta, H., Mumick, I.: Selection of Views to Materialize in a Data Warehouse. IEEE Transactions on Knowledge and Data Engineering, TKDE 17(1/2005), 24–43 (2005)
Han, J., Pei, J., Dong, G., Wang, K.: Efficient Computation of Iceberg Cubes with Complex Measures. In: Proceedings of the International Conference on Management of Data, SIGMOD, pp. 441–448 (2001)
Harinarayan, V., Rajaraman, A., Ullman, J.: Implementing data cubes efficiently. In: Proceedings of the International Conference on Management of Data, SIGMOD, pp. 205–216 (1996)
Lakshmanan, L., Pei, J., Han, J.: Quotient cube: How to summarize the semantics of a data cube. In: Proceedings of the 28th International Conference on Very Large Databases, VLDB, pp. 778–789 (2002)
Laurent, D., Spyratos, N.: Partition semantics for incomplete information in relational databases. In: Proceedings of the International Conference on Management of Data, SIGMOD, pp. 66–73 (1988)
Lopes, S., Petit, J.M., Lakhal, L.: Functional and Approximate Dependency Mining: Databases and FCA points of View. Experimental and Theoretical Artificial Intelligence (JETAI): Special Issue on Concept Lattice-based theory, methods and tools for Knowledge Discovery in Databases 14(2-3), 93–114 (2002)
Mannila, H., Toivonen, H.: Multiple Uses of Frequent Sets and Condensed Representations: Extended Abstract. In: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, KDD, pp. 189–194 (1996)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering Frequent Closed Itemsets for Association Rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398–416. Springer, Heidelberg (1998)
Ross, K., Srivastava, D.: Fast Computation of Sparse Datacubes. In: Proceedings of the 23rd International Conference on Very Large Databases, VLDB, pp. 116–125 (1997)
Shanmugasundaram, J., Fayyad, U., Bradley, P.: Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions. In: Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD, pp. 223–232 (1999)
Vitter, J., Wang, M.: Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets. In: Proceedings ACM SIGMOD International Conference on Management of Data, SIGMOD, pp. 193–204 (1999)
Wang, W., Lu, H., Feng, J., Yu, J.: Condensed Cube: An Effective Approach to Reducing Data Cube Size. In: Proceedings of the 18th International Conference on Data Engineering, ICDE, pp. 213–222 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Casali, A., Cicchetti, R., Lakhal, L., Novelli, N. (2006). Lossless Reduction of Datacubes. In: Bressan, S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2006. Lecture Notes in Computer Science, vol 4080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11827405_40
Download citation
DOI: https://doi.org/10.1007/11827405_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37871-6
Online ISBN: 978-3-540-37872-3
eBook Packages: Computer ScienceComputer Science (R0)