2000 character limit reached
Database Dependencies and Formal Concept Analysis
Published 20 Mar 2024 in cs.DB and cs.LO | (2403.13914v1)
Abstract: This is an account of the characterization of database dependencies with Formal Concept Analysis.
- J. Baixeries. A formal concept analysis framework to model functional dependencies. In Mathematical Methods for Learning, page 40, 06 2004.
- J. Baixeries. Lattice Characterization of Armstrong and Symmetric Dependencies. PhD thesis, Universitat Politècnica de Catalunya, 07 2007.
- J. Baixeries. Formal context for symmetric dependencies. In International Conference on Formal Concept Analysis, page 90, 02 2008.
- J. Baixeries. A new formal context for symmetric dependencies. In Concept Lattices and Their Applications, page 333, 10 2011.
- J. Baixeries. A formal context for acyclic join dependencies. Lecture notes in computer science, pages 563–572, 2017.
- J. Baixeries and J. L. Balcazar. Characterization and armstrong relations for degenerated multivalued dependencies using formal concept analysis. In International Conference on Formal Concept Analysis, page 162. Springer, 02 2005.
- J. Baixeries and J. L. Balcazar. A lattice representation of relations, multivalued dependencies and armstrong relations. In International Conferences on Conceptual Structures, page 13, 07 2005.
- J. Baixeries and J. L. Balcazar. New closure operators and lattice representations for multivalued dependencies and related expressions. In Concept Lattices and Their Applications, page 22, 09 2005.
- J. Baixeries and J. L. Balcazar. Unified characterization of symmetric dependencies with lattices. In International Conference on Formal Concept Analysis, page 57, 02 2006.
- Characterizing approximate-matching dependencies in formal concept analysis with pattern structures. Discrete applied mathematics, 249:18–27, 04 2018.
- Computing functional dependencies with pattern structures. In Concept Lattices and Their Applications, page 175, 10 2012.
- Characterizing functional dependencies in formal concept analysis with pattern structures. Annals of mathematics and artificial intelligence, 72(1-2):129–149, 10 2014.
- Jaume Baixeries. A formal context for closures of acyclic hypergraphs. In Diana Cristea, Florence Le Ber, and Baris Sertkaya, editors, Formal Concept Analysis, pages 259–273, Cham, 2019. Springer International Publishing.
- Computing similarity dependencies with pattern structures. In CLA, pages 33–44, 2013.
- J. L. Balcazar and J. Baixeries. Discrete deterministic data mining as knowledge compilation. In SIAM/IFIP Workshop on Discrete Mathematics & Data Mining, page 40, 2003.
- Characterization of order-like dependencies with formal concept analysis. In Concept Lattices and Their Applications, page 123, 07 2016.
- Formal Concept Analysis - Mathematical Foundations. Springer, 1999.
- George Grätzer. General Lattice Theory. Birkhäuser Verlag, 2. edition, 1998.
- Tane: An efficient algorithm for discovering functional and approximate dependencies. The Computer Journal, 42(2):100–111, 1999.
- Paris C. Kanellakis. Chapter 17 - elements of relational database theory. In Jan Van Leeuwen, editor, Formal Models and Semantics, Handbook of Theoretical Computer Science, pages 1073–1156. Elsevier, Amsterdam, 1990.
- An equivalence between relational database dependencies and a fragment of propositional logic. J. ACM, 28(3):435–453, 1981.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
