scientific article; zbMATH DE number 515654

MaRDI QIDQ4283161zbMATH OpenFDO

Authors Vu Duc Thi, J. Demetrovics

Publication date 10 April 1994

zbMATH Keywords

antikeyclosed setclosurefunctional dependencieskeysminimal generatorminimal keyrelationrelation schemerelational datamodel

Mathematics Subject Classification ID

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

Recommendations

• Some problems concerning keys for relation schemes and relations in the relational datamodel
• scientific article; zbMATH DE number 4041342
• scientific article; zbMATH DE number 4074550
• scientific article; zbMATH DE number 823631
• On the complexity of inferring functional dependencies

Cited in

(13)

• Family of functional dependencies and its equivalent descriptions
• Computing premises of a minimal cover of functional dependencies is intractable
• Ideal non-deterministic operators as a formal framework to reduce the key finding problem
• AN ALGORITHM FOR FINDING ALL FUNCTIONS EMBEDDED IN A RELATION
• scientific article; zbMATH DE number 3843178 (Why is no real title available?)
• scientific article; zbMATH DE number 3907812 (Why is no real title available?)
• scientific article; zbMATH DE number 4039271 (Why is no real title available?)
• scientific article; zbMATH DE number 4074550 (Why is no real title available?)
• scientific article; zbMATH DE number 823631 (Why is no real title available?)
• An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
• scientific article; zbMATH DE number 915917 (Why is no real title available?)
• Some problems concerning keys for relation schemes and relations in the relational datamodel
• On the complexity of finding bounds for projection cardinalities in relational databases

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 Q4283161)