Abstract
In this paper we propose the characterization of two new structures, the Agree Concept Lattice and the Quotient Agree Lattice of a database relation. Both of them are of great interest for multidimensional database analysis. They provide a formal framework which makes it possible to improve computation time, reduce representation and easily navigate through the Hasse diagram. These structures are generic, apply to various database analysis problems and combine formal concept analysis and database theory. They make use of the concepts of agree set and database partition. Agree set and partition are associated to define the Agree Concept of a database relation. The set of all the Agree Concepts is organized within the Agree Concept Lattice. The Quotient Agree Lattice is along the lines of both the Titanic framework and the quotient cube.
We also briefly present three application fields of the proposed structures. The first two ones are classical since they concern on the one hand the discovery of functional and approximate dependencies for database design and tuning and on the other hand the data cube computation and representation. The latter field has been recently investigated. The underlying issue is to retrieve the most relevant objects according to the user expectations: the Skyline. The multidimensional generalization of the Skyline has been proposed through the Skycube. The proposed structures smartly solve the problem of partial materialization of Skycube with reconstruction guarantee.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Hull, R., Vianu, V.: Foundations of databases, vol. 8. Citeseer (1995)
Barbut, M.: Partitions d’un ensemble fini: leur treillis (cosimplexe) et leur représentation géométrique. Mathématiques et Sciences Humaines 22, 5–22 (1968)
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 972–986. Springer, Heidelberg (2000)
Beeri, C., Dowd, M., Fagin, R., Statman, R.: On the structure of armstrong relations for functional dependencies. J. ACM 31(1), 30–46 (1984)
Birkhoff, G.: Lattice Theory, 3rd (new) edn. AMS Colloquium Publications, vol. XXV. American Mathematical Society, Providence (1970)
Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE, pp. 421–430. IEEE Computer Society, Los Alamitos (2001)
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)
Casali, A., Nedjar, S., Cicchetti, R., Lakhal, L.: Closed cube lattices. Annals of Information Systems 3(1), 145–164 (2009a); New Trends in Data Warehousing and Data Analysis
Casali, A., Nedjar, S., Cicchetti, R., Lakhal, L., Novelli, N.: Lossless reduction of datacubes using partitions. IJDWM 5(1), 18–35 (2009)
Diallo, T., Novelli, N., Petit, J.-M.: Discovering (frequent) constant conditional functional dependencies. The International Journal of Data Mining, Modelling and Management, IJDMMM (2011)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
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)
Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. ACM 22(4), 469–476 (1975)
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)
Laporte, M., Novelli, N., Cicchetti, R., Lakhal, L.: Computing full and iceberg datacubes using partitions. In: Hacid, M.-S., Raś, Z.W., Zighed, D.A., Kodratoff, Y. (eds.) ISMIS 2002. LNCS (LNAI), vol. 2366, pp. 244–254. Springer, Heidelberg (2002)
Lopes, S., Petit, J.-M., Lakhal, L.: Efficient discovery of functional dependencies and armstrong relations. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 350–364. Springer, Heidelberg (2000)
Lopes, S., Petit, J.-M., Lakhal, L.: Functional and approximate dependency mining: database and fca points of view. J. Exp. Theor. Artif. Intell. 14(2-3), 93–114 (2002)
Medina, R., Nourine, L.: Conditional functional dependencies: An FCA point of view. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS, vol. 5986, pp. 161–176. Springer, Heidelberg (2010)
Morfonios, K., Konakas, S., Ioannidis, Y.E., Kotsis, N.: Rolap implementations of the data cube. ACM Comput. Surv. 39(4) (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.: Constrained closed datacubes. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS, vol. 5986, pp. 177–192. Springer, Heidelberg (2010a)
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., Cicchetti, R., Lakhal, L.: Constrained Closed and Quotient Cubes, ch. 5. SCI, vol. 2. Springer, Heidelberg (2010)
Nedjar, S., Pesci, F., Cicchetti, R., Lakhal, L.: Treillis des concepts skylines: Analyse multidimensionnelle des skylines fondée sur les ensembles en accord. In: EGC 2011 – Extraction et Gestion Des Connaissances, Revue des Nouvelles Technologies de l’Information, Cépaduès-Éditions (2011)
Novelli, N., Cicchetti, R.: Functional and embedded dependency inference: a data mining point of view. Inf. Syst. 26(7), 477–506 (2001)
Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Information Systems 24(1), 25–46 (1999)
Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., Lakhal, L.: Generating a condensed representation for association rules. J. Intell. Inf. Syst. 24(1), 29–60 (2005)
Pei, J., Jin, W., Ester, M., Tao, Y.: Catching the best views of skyline: A semantic approach based on decisive subspaces. In: VLDB, pp. 253–264 (2005)
Pei, J., Yuan, Y., Lin, X., Jin, W., Ester, M., Liu, Q., Wang, W., Tao, Y., Yu, J.X., Zhang, Q.: Towards multidimensional subspace skyline analysis. ACM Trans. Database Syst. 31(4), 1335–1381 (2006)
Spyratos, N.: The partition model: A deductive database model. ACM Trans. Database Syst. 12(1), 1–37 (1987)
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with titanic. Data Knowl. Eng. 42(2), 189–222 (2002)
Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J.X., Zhang, Q.: Efficient computation of the skyline cube. In: VLDB, pp. 241–252 (2005)
Zaki, M.J.: Generating non-redundant association rules. In: KDD, pp. 34–43 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nedjar, S., Pesci, F., Lakhal, L., Cicchetti, R. (2011). The Agree Concept Lattice for Multidimensional Database Analysis. In: Valtchev, P., Jäschke, R. (eds) Formal Concept Analysis. ICFCA 2011. Lecture Notes in Computer Science(), vol 6628. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20514-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-20514-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20513-2
Online ISBN: 978-3-642-20514-9
eBook Packages: Computer ScienceComputer Science (R0)