On the Structure of Armstrong Relations for Functional Dependencies

DOI10.1145/2422.322414MaRDI QIDQ3766891zbMATH OpenOpenAlexWikidataFDO

Authors Catriel Beeri, Martin Dowd, Ronald Fagin, 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

zbMATH Keywords

Armstrong relationfunctional dependencylogical consequencerandom relationrelational database

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cited in

(40)

• A simple characterization of database dependency implication
• Non-finite specifiability of projections of functional dependency families
• Database survivability under dynamic constraints
• 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
• Direct product decompositions of lattices, closures and relation schemes
• Axiomatisation of functional dependencies in incomplete relations
• Algorithms for generating an Armstrong relation and inferring functional dependencies in the relational datamodel
• Functional dependencies among Boolean dependencies
• Asymptotic properties of keys and functional dependencies in random databases
• A finite axiomatization of G-dependence
• Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
• Automatic generation of test data for relational queries
• Horn approximations of empirical data
• Some results about normal forms for functional dependency in the relational datamodel
• The implication problem for functional dependencies and variants of marginal distribution equivalences
• Characterizing functional dependencies in formal concept analysis with pattern structures
• Possibilistic keys
• Representing lattices using many-valued relations
• Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
• Reasoning with models
• Logical foundations of possibilistic keys
• The agree concept lattice for multidimensional database analysis
• A theory of data dependencies over relational expressions
• Characterisations of multivalued dependency implication over undetermined universes
• Algorithms for k-meet-semidistributive lattices
• Design by example: An application of Armstrong relations
• Parameterised complexity of model checking and satisfiability in propositional dependence logic
• Normal forms and syntactic completeness proofs for functional independencies
• Approximating minimum keys and optimal substructure screens
• Towards declarative comparabilities: application to functional dependencies
• The implication problem for functional dependencies and variants of marginal distribution equivalences
• Polynomial delay hybrid algorithms to enumerate candidate keys for a relation
• Common equivalence and size of forgetting from Horn formulae
• Approximate inference of functional dependencies from relations
• Some problems concerning keys for relation schemes and relations in the relational datamodel
• Closed sets and translations of relation schemes
• Abstract functional dependency structures
• Reformulating table constraints using functional dependencies-an application to explanation generation

This page was built for publication: On the Structure of Armstrong Relations for Functional Dependencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3766891)