On the number of candidate keys

DOI10.1016/0020-0190(78)90013-3zbMath0394.68015OpenAlexW2051190538MaRDI QIDQ1252714

Janos Demetrovics

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0020-0190(78)90013-3

zbMATH Keywords

Candidate KeysData BasesFunctional DependenciesRelational Model

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (4)

On the finite and general implication problems of independence atoms and keys ⋮ Some Remarks on Relational Database Schemes Having Few Minimal Keys ⋮ Unnamed Item ⋮ Closed sets and translations of relation schemes

Cites Work

• On the complexity of finding the set of candidate keys for a given set of functional dependencies
• A relational model of data for large shared data banks
• Decomposition of a Data Base and the Theory of Boolean Switching Functions

This page was built for publication: On the number of candidate keys