Abstract
Armstrong and symmetric dependencies are two of the main groups of dependencies in the relational database model, both of them having their own set of axioms. The closure of a set of dependencies is the largest set of dependencies that can be calculated by the recursive application of those axioms. There are two problems related to a closure: its calculation and its characterization. Formal concept analysis has dealt with those problems in the case of Armstrong dependencies (that is, functional dependencies and alike).
In this paper, we present a formal context for symmetric dependencies that calculates the closure and the lattice characterization of a set of symmetric dependencies.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baixeries, J., Balcázar, J.L.: Discrete Deterministic Data Mining as Knowledge Compilation. In: Proceedings of Workshop on Discrete Mathematics and Data Mining in SIAM International Conference on Data Mining (2003)
Baixeries, J.: A Formal Concept Analysis Framework To Model Functional Dependencies. In: Proceedings of Mathematical Methods for Learning (2004)
Baixeries, J., Balcázar, J.L.: Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis. Formal Concept Analysis. In: Third International Conference, ICFCA 2005, Lens, France, February 14-18, 2005, Proceedings. Lecture Notes in Computer Science (2005)
Baixeries, J., Balcázar, J.L.: Unified Characterization of Symmetric Dependencies with Lattices. In: Contributions to ICFCA 2006. 4th International Conference on Formal Concept Analysis (2005)
Beeri, C.: On the Membership Problem for Functional and Multivalued Dependencies in Relational Databases. ACM Transactions on Database Systems (September 1980)
Beeri, C., Vardi, M.: Formal Systems for Tuple and Equality Generating Dependencies. SIAM Journal on Computing (1984)
Caspard, N., Monjardet, B.: The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: a Survey. In: Proceedings of the 1998 Conference on Ordinal and Symbolic Data Analysis (OSDA-98). Discrete Applied Mathematics (2003)
Day, A.: A Lattice Interpretation of Database Dependencies. Semantics of Programming Languages and Model Theory (1993)
Demetrovics, J., et al.: Normal Form Relation Schemes: a New Characterization. Acta Cybernetica (1992)
Demetrovics, J., Huy, X.: Representation of Closure for Functional, Multivalued and Join Dependencies. Computers and Artificial Intelligence (1992)
Demetrovics, J., Libkin, L., Muchnik, I.: Functional Dependencies in Relational Databases: a Lattice Point of View. Discrete Applied Mathematics (1992)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)
Beeri, C., Fagin, R., Howard, J.H.: A Complete Axiomatization for Functional and Multivalued Dependencies in Database Relations. In: Proceedings of the 1977 ACM SIGMOD International Conference on Management of Data, August 3-5, 1977, Toronto, Canada (1977)
Fagin, R.: Armstrong Databases. In: Proc. 7th IBM Symposium on Mathematical Foundations of Computer Science, Kanagawa, Japan (1982)
Duquenne, V., Guigues, J.L.: Familles Minimales d’Implications Informatives Resultant d’un Tableau de Donées Binaires. Mathematics and Social Sciences (1986)
Gottlob, E., Libkin, L.: Investigations on Armstrong Relations, Dependency Inference, and Excluded Functional Dependencies. Acta Cybernetica (1990)
Grätzer, G.: General Lattice Theory. Academic Press, London (1978)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
Kuznetsov, S.O., Obiedkov, S.A.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artificial Intelligence 14(2–3) (2004)
Kuznetsov, S.O., Obiedkov, S.A.: Algorithms for the Construction of Concept Lattices and Their Diagram Graphs. In: Siebes, A., De Raedt, L. (eds.) PKDD 2001. LNCS (LNAI), vol. 2168, Springer, Heidelberg (2001)
Lopes, S., Petit, J.-M., Lakhal, L.: Functional and Approximate Dependency Mining: Database and FCA Points of View. Journal of Experimental and Theoretical Artificial Intelligence 14(2-3) (2002)
Lopes, S., Petit, J.-M., Lakhal, L.: Efficient Discovery of Functional Dependencies and Armstrong Relations. In: Zaniolo, C., et al. (eds.) EDBT 2000. LNCS, vol. 1777, Springer, Heidelberg (2000)
Ullman, J.D.: Principles of Database Systems. Computer Science Press (1982)
Valtchev, P., Missaoui, R., Lebrun, P.: A Fast Algorithm for Building the Hasse Diagram of a Galois Lattice. Actes du Colloque LaCIM (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baixeries, J. (2008). A Formal Context for Symmetric Dependencies. In: Medina, R., Obiedkov, S. (eds) Formal Concept Analysis. ICFCA 2008. Lecture Notes in Computer Science(), vol 4933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78137-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-78137-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78136-3
Online ISBN: 978-3-540-78137-0
eBook Packages: Computer ScienceComputer Science (R0)