The number of keys in relational and nested relational databases

DOI10.1016/0166-218X(92)90033-7zbMath0767.68036MaRDI QIDQ1202895

Bernhard Thalheim

Publication date: 31 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

relational databasemaximal number of minimal keys

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

A survey of some combinatorial results concerning functional dependencies in database relations. ⋮ Dependencies and generalized relations ⋮ Some Remarks on Relational Database Schemes Having Few Minimal Keys ⋮ Foundations for a Fourth Normal Form over SQL-Like Databases ⋮ Controlling entity integrity with key sets ⋮ On the Existence of Armstrong Instances with Bounded Domains ⋮ Coding Theory Motivated by Relational Databases

Cites Work

• Design by example: An application of Armstrong relations
• Minimum matrix representation of closure operations
• On the number of maximal dependencies in a data base relation of fixed order
• Armstrong databases for functional and inclusion dependencies
• Candidate keys for relations
• Contribution to the theory of data base relations
• On the Structure of Armstrong Relations for Functional Dependencies
• Candidate Keys and Antichains
• A relational model of data for large shared data banks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item