Candidate keys for relations

DOI10.1016/0022-0000(78)90009-0zbMath0395.68025WikidataQ56227692 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

zbMATH Keywords

Algorithms; Candidate Keys; Np-Complete; Relational Data Base

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68P05: Data structures

68P20: Information storage and retrieval of data

68W99: Algorithms in computer science

Related Items

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, On the finite and general implication problems of independence atoms and keys, Optimal covers in the relational database model, Autonomous sets for the hypergraph of all canonical covers, An efficient algorithm for 3NF determination, Some problems concerning keys for relation schemes and relations in the relational datamodel, Closed sets and translations of relation schemes, Towards an abstract theory of dependency constraints in relational databases, On the desirability of \(\gamma\)-acyclic BCNF database schemes, The complexity of recognizing 3NF relation schemes, Polynomial tests of normal forms and some related results, Functional dependencies in relational databases: A lattice point of view, The number of keys in relational and nested relational databases, Algorithms for generating an Armstrong relation and inferring functional dependencies in the relational datamodel, Discrimination of singleton and periodic attractors in Boolean networks, 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, Some results about normal forms for functional dependency in the relational datamodel, A complexity theory for hard enumeration problems, A Generalisation of Entity and Referential Integrity in Relational Databases, LoCo—A Logic for Configuration Problems, Some Remarks on Relational Database Schemes Having Few Minimal Keys, Unnamed Item

Cites Work

• A relational model of data for large shared data banks
• Decomposition of a Data Base and the Theory of Boolean Switching Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item