Candidate keys for relations
From MaRDI portal
Publication:1253096
DOI10.1016/0022-0000(78)90009-0zbMath0395.68025OpenAlexW2063645305WikidataQ56227692 ScholiaQ56227692MaRDI QIDQ1253096
Sylvia L. Osborn, Cláudio Leonardo Lucchesi
Publication date: 1978
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(78)90009-0
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20) Algorithms in computer science (68W99)
Related Items (32)
On the finite and general implication problems of independence atoms and keys ⋮ Optimal covers in the relational database model ⋮ Towards an abstract theory of dependency constraints in relational databases ⋮ On the desirability of \(\gamma\)-acyclic BCNF database schemes ⋮ Enumerating teams in first-order team logics ⋮ Some results about normal forms for functional dependency in the relational datamodel ⋮ Discrimination of singleton and periodic attractors in Boolean networks ⋮ LoCo—A Logic for Configuration Problems ⋮ Unique key Horn functions ⋮ Some Remarks on Relational Database Schemes Having Few Minimal Keys ⋮ The algebraic structure of the densification and the sparsification tasks for CSPs ⋮ Controlling entity integrity with key sets ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements ⋮ Approximating minimum keys and optimal substructure screens ⋮ Autonomous sets for the hypergraph of all canonical covers ⋮ The complexity of recognizing 3NF relation schemes ⋮ Polynomial tests of normal forms and some related results ⋮ Some problems concerning keys for relation schemes and relations in the relational datamodel ⋮ Unnamed Item ⋮ Functional dependencies in relational databases: A lattice point of view ⋮ The number of keys in relational and nested relational databases ⋮ A Generalisation of Entity and Referential Integrity in Relational Databases ⋮ An efficient algorithm for 3NF determination ⋮ A complexity theory for hard enumeration problems ⋮ Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory ⋮ On the Complexity of Computing Generators of Closed Sets ⋮ Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs ⋮ Closed sets and translations of relation schemes ⋮ An algebraic point of view of the data structures of database systems ⋮ On the relationship of minimum and optimum covers for a set of functional dependencies ⋮ Algorithms for generating an Armstrong relation and inferring functional dependencies in the relational datamodel ⋮ Enumerating maximal consistent closed sets in closure systems
Cites Work
This page was built for publication: Candidate keys for relations
