On the Structure of Armstrong Relations for Functional Dependencies
From MaRDI portal
Publication:3766891
DOI10.1145/2422.322414zbMath0629.68096OpenAlexW2098102356WikidataQ56571461 ScholiaQ56571461MaRDI QIDQ3766891
Ronald Fagin, Martin Dowd, Catriel Beeri, Richard Statman
Publication date: 1984
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2422.322414
Related Items
A simple characterization of database dependency implication, Non-finite specifiability of projections of functional dependency families, Database survivability under dynamic constraints, Functional dependencies among Boolean dependencies, Representing lattices using many-valued relations, Logical Foundations of Possibilistic Keys, Some results about normal forms for functional dependency in the relational datamodel, Asymptotic properties of keys and functional dependencies in random databases, Reasoning with models, A finite axiomatization of G-dependence, Approximating minimum keys and optimal substructure screens, Characterisations of multivalued dependency implication over undetermined universes, Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty, The Agree Concept Lattice for Multidimensional Database Analysis, Reformulating table constraints using functional dependencies-an application to explanation generation, Approximate inference of functional dependencies from relations, Algorithms for \(k\)-meet-semidistributive lattices, Some problems concerning keys for relation schemes and relations in the relational datamodel, 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, Characterizing functional dependencies in formal concept analysis with pattern structures, Direct product decompositions of lattices, closures and relation schemes, Design by example: An application of Armstrong relations, Normal forms and syntactic completeness proofs for functional independencies, Characterizing approximate-matching dependencies in formal concept analysis with pattern structures, Parameterised complexity of model checking and satisfiability in propositional dependence logic, Closed sets and translations of relation schemes, Axiomatisation of functional dependencies in incomplete relations, Automatic generation of test data for relational queries, Possibilistic keys, A theory of data dependencies over relational expressions, Horn approximations of empirical data, 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, Abstract functional dependency structures
