On the complexity of finding the set of candidate keys for a given set of functional dependencies

DOI10.1016/0020-0190(76)90003-XzbMath0336.68018OpenAlexW2076452193WikidataQ114685349 ScholiaQ114685349MaRDI QIDQ1229752

K. Appert

Publication date: 1976

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90003-x

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (5)

The complexity of recognizing 3NF relation schemes ⋮ Unnamed Item ⋮ On the number of candidate keys ⋮ Contribution to the theory of data base relations ⋮ Some generalized type functional dependencies formalized as equality set on matrices

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

This page was built for publication: On the complexity of finding the set of candidate keys for a given set of functional dependencies