Abstract
This paper focuses on borders and lossless representations for Constrained Datacubes of database relations, which can represent many-valued contexts. The final goal is to optimize both storage space and computation time. First we study the succinct representation through the borders Lower / Upper and Upper \(^\sharp\) / Upper. However, these borders are not information-lossless. Therefore, by using the concept of cube closure, from a FCA perspective, we define three new information lossless representations for Constrained Datacubes: the L-Constrained Closed Datacube, the \(U^\sharp\)-Constrained Closed Datacube and the \(U^{\sharp\sharp}\)-Constrained Closed Cube. The latter is obtained by using the constrained closed tuples along with the border Upper \(^\sharp\) from which redundancy is discarded in order to obtain an optimal representation. Finally, we evaluate experimentally the size of the introduced representations. The results are strongly emphasizing the idea that the latest structure is, to the best of our knowledge, the smallest representation of Constrained Datacubes.
Chapter PDF
Similar content being viewed by others
References
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 Min. Knowl. Discov. 1(1), 29–53 (1997)
Casali, A., Nedjar, S., Cicchetti, R., Lakhal, L.: Convex cube: Towards a unified structure for multidimensional databases. In: Wagner, R., Revell, N., Pernul, G. (eds.) DEXA 2007. LNCS, vol. 4653, pp. 572–581. Springer, Heidelberg (2007)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2006)
Pei, J., Han, J., Lakshmanan, L.V.S.: Pushing convertible constraints in frequent itemset mining. Data Min. Knowl. Discov. 8(3), 227–252 (2004)
Beyer, K.S., Ramakrishnan, R.: Bottom-up computation of sparse and iceberg cubes. In: Delis, A., Faloutsos, C., Ghandeharizadeh, S. (eds.) SIGMOD Conference, pp. 359–370. ACM Press, New York (1999)
Nedjar, S., Casali, A., Cicchetti, R., Lakhal, L.: Emerging cubes for trends analysis in olap databases. In: Song, I.-Y., Eder, J., Nguyen, T.M. (eds.) DaWaK 2007. LNCS, vol. 4654, pp. 135–144. Springer, Heidelberg (2007)
Nedjar, S., Casali, A., Cicchetti, R., Lakhal, L.: Emerging cubes: Borders, size estimations and lossless reductions. Information Systems 34(6), 536–550 (2009)
Nedjar, S., Casali, A., Cicchetti, R., Lakhal, L.: Reduced representations of emerging cubes for olap database mining. IJBIDM 5(1), 268–300 (2010)
Nedjar, S.: Exact and approximate sizes of convex datacubes. In: Pedersen, T.B., Mohania, M.K., Tjoa, A.M. (eds.) DaWaK 2009. LNCS, vol. 5691, pp. 204–215. Springer, Heidelberg (2009)
Casali, A., Nedjar, S., Cicchetti, R., Lakhal, L.: Closed cube lattices. Annals of Information Systems 3(1), 145–164 (2009); New Trends in Data Warehousing and Data Analysis
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
Casali, A., Cicchetti, R., Lakhal, L.: Cube lattices: A framework for multidimensional data mining. In: Barbará, D., Kamath, C. (eds.) SDM. SIAM, Philadelphia (2003)
Lakshmanan, L.V.S., Pei, J., Han, J.: Quotient cube: How to summarize the semantics of a data cube. In: Lochovsky, F.H., Shan, W. (eds.) VLDB, pp. 778–789. Morgan Kaufmann, San Francisco (2002)
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with titanic. Data Knowl. Eng. 42(2), 189–222 (2002)
Bonchi, F., Lucchese, C.: On closed constrained frequent pattern mining. In: Morik, K., Rastogi, R. (eds.) ICDM, pp. 35–42. IEEE Computer Society, Los Alamitos (2004)
Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., Yiu, T.: Mafia: A maximal frequent itemset algorithm. IEEE Trans. Knowl. Data Eng. 17(11), 1490–1504 (2005)
Casali, A., Cicchetti, R., Lakhal, L.: Extracting semantics from data cubes using cube transversals and closures. In: Getoor, L., Senator, T.E., Domingos, P., Faloutsos, C. (eds.) KDD, pp. 69–78. ACM, New York (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nedjar, S., Casali, A., Cicchetti, R., Lakhal, L. (2010). Constrained Closed Datacubes . In: Kwuida, L., Sertkaya, B. (eds) Formal Concept Analysis. ICFCA 2010. Lecture Notes in Computer Science(), vol 5986. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11928-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-11928-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11927-9
Online ISBN: 978-3-642-11928-6
eBook Packages: Computer ScienceComputer Science (R0)