THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
From MaRDI portal
Publication:4029566
DOI10.1142/S0218196792000256zbMath0798.68049WikidataQ114614795 ScholiaQ114614795MaRDI QIDQ4029566
Publication date: 28 March 1993
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
polynomial time algorithm; closure operators; relational databases; functional dependencies; concept lattices; normal decompositions; critical quotients; complete join-congruence
Related Items
On the Merge of Factor Canonical Bases, On critical sets of a finite Moore family, The joy of implications, aka pure Horn formulas: mainly a survey, Succinctness and tractability of closure operator representations, The poset of closure systems on an infinite poset: detachability and semimodularity, On implicational bases of closure systems with unique critical sets., Horn axiomatizations for sequential data, Lattices, closures systems and implication bases: a survey of structural aspects and algorithms, Characterizing approximate-matching dependencies in formal concept analysis with pattern structures, The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey, Alan Day's work on modular and arguesian lattices, Computers and universal algebra: Some directions, Quasi-closed elements in fuzzy posets, Optimizations in computing the Duquenne-Guigues basis of implications, Attribute-incremental construction of the canonical implication basis, Unnamed Item, OnL-fuzzy Chu correspondences
