Some remarks on relational database schemes having few minimal keys

DOI10.1007/978-3-642-28279-9_3MaRDI QIDQ3223995zbMATH OpenOpenAlexFDO

Authors 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

Boyce-Codd normal formcomputational complexityextremal attributefunctional dependencyfunctional relationshipimplicational closurelogical implicationminimal keyminimal-key equivalenceNP-completenessobject normal formprime attributerelation schemerelational databasesemantic modelingSperner systemsuperprime attributethird normal form

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4209578
• Some results about normal forms for functional dependency in the relational datamodel
• scientific article; zbMATH DE number 4049168
• scientific article; zbMATH DE number 4068343
• scientific article; zbMATH DE number 3913729

Cites work

• A note on relation schemes which are in 3NF but not in BCNF
• Asymptotic properties of keys and functional dependencies in random databases
• Boyce-Codd normal form and object normal forms
• Candidate keys for relations
• scientific article; zbMATH DE number 4209578 (Why is no real title available?)
• scientific article; zbMATH DE number 3666227 (Why is no real title available?)
• scientific article; zbMATH DE number 43047 (Why is no real title available?)
• scientific article; zbMATH DE number 41085 (Why is no real title available?)
• scientific article; zbMATH DE number 108396 (Why is no real title available?)
• scientific article; zbMATH DE number 108405 (Why is no real title available?)
• scientific article; zbMATH DE number 1466150 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• On keys and functional dependencies as first-class citizens in description logics
• On the number of candidate keys
• Reducing inference control to access control for normalized database schemas
• The number of keys in relational and nested relational databases

Cited in

(4)

• scientific article; zbMATH DE number 4209578 (Why is no real title available?)
• scientific article; zbMATH DE number 3913729 (Why is no real title available?)
• scientific article; zbMATH DE number 4049168 (Why is no real title available?)
• scientific article; zbMATH DE number 1543290 (Why is no real title available?)

This page was built for publication: Some remarks on relational database schemes having few minimal keys

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3223995)