Some Remarks on Relational Database Schemes Having Few Minimal Keys

DOI10.1007/978-3-642-28279-9_3zbMath1312.68077OpenAlexW1602602809MaRDI QIDQ3223995

Joachim Biskup

Publication date: 9 March 2012

Published in: Conceptual Modelling and Its Theoretical Foundations (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28279-9_3

zbMATH Keywords

computational complexityNP-completenessrelational databasefunctional dependencylogical implicationBoyce-Codd normal formthird normal formrelation schemeSperner systemfunctional relationshipsemantic modelingminimal keyextremal attributeimplicational closureminimal-key equivalenceobject normal formprime attributesuperprime attribute

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On keys and functional dependencies as first-class citizens in description logics
• Reducing inference control to access control for normalized database schemas
• Boyce-Codd normal form and object normal forms
• The number of keys in relational and nested relational databases
• On the number of candidate keys
• Candidate keys for relations
• A note on relation schemes which are in 3NF but not in BCNF
• Asymptotic properties of keys and functional dependencies in random databases