Some remarks on functional dependencies in relational datamodels

The concept of minimal family is introduced. We prove that this family and family of functional dependencies (FDs ) determine each other uniquely. A characterization of this family is presented. We show that there is no polynomial time algorithm finding a minimal family from a given relation scheme. We prove that the time complexity of finding a minimal family from a given relation is exponential in the number of attributes