Design by example: An application of Armstrong relations
From MaRDI portal
Recommendations
- Constructing designs straightforwardly: Worst arising cases
- Extending the algebras of design
- scientific article; zbMATH DE number 4170925
- scientific article; zbMATH DE number 4164730
- A MATHEMATICAL THEORY OF DESIGN Representation of Design Artifacts (Part I)
- scientific article; zbMATH DE number 4018166
Cites work
- Armstrong databases for functional and inclusion dependencies
- Horn clauses and database dependencies
- scientific article; zbMATH DE number 3890770 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 3464830 (Why is no real title available?)
- On the family of generalized dependency constraints
- On the Structure of Armstrong Relations for Functional Dependencies
Cited in
(35)- 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
- Reasoning with examples: Propositional formulae and database dependencies
- Algorithms for generating an Armstrong relation and inferring functional dependencies in the relational datamodel
- Family of functional dependencies and its equivalent descriptions
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
- Automatic generation of test data for relational queries
- Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- Some results about normal forms for functional dependency in the relational datamodel
- The implication problem for functional dependencies and variants of marginal distribution equivalences
- Constructing Armstrong tables for general cardinality constraints and not-null constraints
- Maximal sensitivity of Boolean nested canalizing functions
- Possibilistic keys
- Reasoning about functional and full hierarchical dependencies over partial relations
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- Reasoning with models
- scientific article; zbMATH DE number 1665450 (Why is no real title available?)
- Logical foundations of possibilistic keys
- scientific article; zbMATH DE number 2089481 (Why is no real title available?)
- Coding theory motivated by relational databases
- Characterisations of multivalued dependency implication over undetermined universes
- Generating dual-bounded hypergraphs
- Functional and approximate dependency mining: database and FCA points of view
- scientific article; zbMATH DE number 1507283 (Why is no real title available?)
- The joy of implications, aka pure Horn formulas: mainly a survey
- Algorithms for k-meet-semidistributive lattices
- The implication problem for functional dependencies and variants of marginal distribution equivalences
- Approximate inference of functional dependencies from relations
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- On the complexity of monotone dualization and generating minimal hypergraph transversals
- Self-duality of bounded monotone Boolean functions and related problems
This page was built for publication: Design by example: An application of Armstrong relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579962)
