Candidate keys for relations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3566230 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- A relational model of data for large shared data banks
- Decomposition of a Data Base and the Theory of Boolean Switching Functions
Cited in
(32)- LoCo—A Logic for Configuration Problems
- Towards an abstract theory of dependency constraints in relational databases
- Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
- On the finite and general implication problems of independence atoms and keys
- An efficient algorithm for 3NF determination
- On the desirability of \(\gamma\)-acyclic BCNF database schemes
- Autonomous sets for the hypergraph of all canonical covers
- Algorithms for generating an Armstrong relation and inferring functional dependencies in the relational datamodel
- A generalisation of entity and referential integrity in relational databases
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Optimal covers in the relational database model
- The complexity of recognizing 3NF relation schemes
- Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory
- On the Complexity of Computing Generators of Closed Sets
- Enumerating maximal consistent closed sets in closure systems
- Approximating minimum keys and optimal substructure screens
- The number of keys in relational and nested relational databases
- Closed sets and translations of relation schemes
- Some results about normal forms for functional dependency in the relational datamodel
- Some problems concerning keys for relation schemes and relations in the relational datamodel
- scientific article; zbMATH DE number 3907812 (Why is no real title available?)
- Some remarks on relational database schemes having few minimal keys
- Enumerating teams in first-order team logics
- Unique key Horn functions
- Discrimination of singleton and periodic attractors in Boolean networks
- On the relationship of minimum and optimum covers for a set of functional dependencies
- Polynomial delay hybrid algorithms to enumerate candidate keys for a relation
- Polynomial tests of normal forms and some related results
- Controlling entity integrity with key sets
- An algebraic point of view of the data structures of database systems
- Functional dependencies in relational databases: A lattice point of view
- The algebraic structure of the densification and the sparsification tasks for CSPs
This page was built for publication: Candidate keys for relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1253096)