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....
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
1994
|
| Series: | Acta cybernetica
11 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12538 |
| Summary: | 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. |
|---|---|
| Physical Description: | 345-352 |
| ISSN: | 0324-721X |