scientific article; zbMATH DE number 3907812

MaRDI QIDQ3685241zbMATH OpenFDO

Authors E. Pichat

Publication date 1985

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

zbMATH Keywords

conditional projectioncontribution graph of a set of functional dependencieskey decomposition algorithmpolynomial time complexity

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• scientific article; zbMATH DE number 4041342
• scientific article; zbMATH DE number 515654
• scientific article; zbMATH DE number 915917
• Some problems concerning keys for relation schemes and relations in the relational datamodel
• scientific article; zbMATH DE number 3913729

Cites work

• A new normal form for the design of relational database schemata
• A relational model of data for large shared data banks
• An improved third normal form for relational databases
• Candidate keys for relations
• Contribution to the theory of data base relations
• Decomposition of a Data Base and the Theory of Boolean Switching Functions
• scientific article; zbMATH DE number 3890770 (Why is no real title available?)
• scientific article; zbMATH DE number 3915664 (Why is no real title available?)
• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• On the complexity of finding the set of candidate keys for a given set of functional dependencies
• On the number of candidate keys

Cited in

(3)

• scientific article; zbMATH DE number 3958758 (Why is no real title available?)
• scientific article; zbMATH DE number 915917 (Why is no real title available?)
• About Keys of Formal Context and Conformal Hypergraph

This page was built for publication:

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