Minimal Cover with functional dependencies (database)

Question

I think I understand a bit how to compute the minimal cover of a set of functional dependencies.
But there's something I don't understand. Let's say we have these functional dependencies:

H --> ABCD
ABCD --> H  
B --> H
CD --> H

How should I compute the minimal cover of this?
Can I ignore B --> H and CD --> H or should I ignore A?

Thank you very much.

How does your textbook tell you to compute the minimal cover? — Mike Sherrill 'Cat Recall', May 30 '13 at 11:16

score 0 · Answer 1 · answered Jun 19 '13 at 19:33

0

Minimal cover is not necessarily unique. In your example B, CD and H are minimal covers.

answered Jun 19 '13 at 19:33

Alexander Serebrenik

3,567
2
16
32

Minimal Cover with functional dependencies (database)

1 Answers1