Abstract
Database constraints in the relational database model (RDBM) can be viewed as a set of rules that apply to a dataset, or as a set of axioms that can generate a (closed) set of those constraints. In this paper, we use Formal Concept Analysis to characterize the axioms of Acyclic Hypergraphs (in the RDBM they are called Acyclic Join Dependencies). This present paper complements and generalizes previous work on FCA and databases constraints.
Author supplied keywords
Cite
CITATION STYLE
Baixeries, J. (2019). A formal context for closures of acyclic hypergraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11511 LNAI, pp. 259–273). Springer Verlag. https://doi.org/10.1007/978-3-030-21462-3_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
