Design by example: An application of Armstrong relations
From MaRDI portal
Publication:579962
DOI10.1016/0022-0000(86)90015-2zbMath0625.68075OpenAlexW2086073919WikidataQ61450086 ScholiaQ61450086MaRDI QIDQ579962
Heikki Mannila, Kari-Jouko Raeihae
Publication date: 1986
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6505
relational databasedatabase designfunctional dependenciesArmstrong relationsBoyce-Codd Normal Formrepresentations of dependency sets
Related Items
Dual-bounded generating problems: Weighted transversals of a hypergraph, Family of functional dependencies and its equivalent descriptions, Logical Foundations of Possibilistic Keys, Some results about normal forms for functional dependency in the relational datamodel, Reasoning with models, Characterisations of multivalued dependency implication over undetermined universes, Reasoning about functional and full hierarchical dependencies over partial relations, Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty, A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs, Approximate inference of functional dependencies from relations, On the complexity of monotone dualization and generating minimal hypergraph transversals, Self-duality of bounded monotone Boolean functions and related problems, The joy of implications, aka pure Horn formulas: mainly a survey, Algorithms for \(k\)-meet-semidistributive lattices, Functional dependencies in relational databases: A lattice point of view, On the complexity of inferring functional dependencies, The number of keys in relational and nested relational databases, Constructing Armstrong tables for general cardinality constraints and not-null constraints, Direct product decompositions of lattices, closures and relation schemes, Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry, Generating dual-bounded hypergraphs, Functional and approximate dependency mining: database and FCA points of view, Maximal sensitivity of Boolean nested canalizing functions, Axiomatisation of functional dependencies in incomplete relations, Automatic generation of test data for relational queries, Possibilistic keys, Algorithms for generating an Armstrong relation and inferring functional dependencies in the relational datamodel, The implication problem for functional dependencies and variants of marginal distribution equivalences, Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
Cites Work
