The following pages link to Candidate keys for relations (Q1253096):
Displaying 27 items.
- On the finite and general implication problems of independence atoms and keys (Q269507) (← links)
- Optimal covers in the relational database model (Q303689) (← links)
- Autonomous sets for the hypergraph of all canonical covers (Q429444) (← links)
- An efficient algorithm for 3NF determination (Q558039) (← links)
- Some problems concerning keys for relation schemes and relations in the relational datamodel (Q685518) (← links)
- Closed sets and translations of relation schemes (Q751255) (← links)
- Towards an abstract theory of dependency constraints in relational databases (Q1097050) (← links)
- On the desirability of \(\gamma\)-acyclic BCNF database schemes (Q1111780) (← links)
- The complexity of recognizing 3NF relation schemes (Q1166279) (← links)
- Polynomial tests of normal forms and some related results (Q1192504) (← links)
- Functional dependencies in relational databases: A lattice point of view (Q1202888) (← links)
- The number of keys in relational and nested relational databases (Q1202895) (← links)
- Algorithms for generating an Armstrong relation and inferring functional dependencies in the relational datamodel (Q1309754) (← links)
- Discrimination of singleton and periodic attractors in Boolean networks (Q1680922) (← links)
- An algebraic point of view of the data structures of database systems (Q1823030) (← links)
- On the relationship of minimum and optimum covers for a set of functional dependencies (Q1836314) (← links)
- Some results about normal forms for functional dependency in the relational datamodel (Q1923601) (← links)
- Enumerating maximal consistent closed sets in closure systems (Q2117117) (← links)
- Enumerating teams in first-order team logics (Q2172832) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- Unique key Horn functions (Q2672584) (← links)
- A Generalisation of Entity and Referential Integrity in Relational Databases (Q2771491) (← links)
- LoCo—A Logic for Configuration Problems (Q2946729) (← links)
- Some Remarks on Relational Database Schemes Having Few Minimal Keys (Q3223995) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
- Controlling entity integrity with key sets (Q6098153) (← links)
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements (Q6165553) (← links)
