scientific article

zbMath0568.68075MaRDI QIDQ3685241

E. Pichat

Publication date: 1985

Full work available at URL: https://eudml.org/doc/92231

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial time complexityconditional projectioncontribution graph of a set of functional dependencieskey decomposition algorithm

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of finding the set of candidate keys for a given set of functional dependencies
• On the number of candidate keys
• Candidate keys for relations
• Contribution to the theory of data base relations
• An improved third normal form for relational databases
• A new normal form for the design of relational database schemata
• 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: