📝 Question
#1263
The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is
✓
Correct Answer
A. BCNF algorithm
💡
Explanation
The result is not uniquely defined, since a set of functional dependencies can have more than one canonical cover, and, further, in some cases, the result of the algorithm depends on the order in which it considers the dependencies in Fc.
⌨️ Press
A
B
C
D
to select