Consider the Relation R={A, B, C, D, E, F, G, H } and the set of functional dependencies. A→C B→CG AD→EH C→DF A→H What is the key for R? Decompose R into 2NF, 3NF and finally in BCNF relation.
Answers
Answered by
3
Given a relation R(A, B, C) with functional dependencies set {A → B, B → C, C → B}
(i) lossless decomposition is always possible for R
(ii) Dependency preserving decomposition is always possible for R.
Assume decomposition includes all the attributes of R. Which of the following is correct?
A) Both (i) and (ii) true
B) (i) is true and (ii) is false
C) (i) is false and (ii) is true
D) Both (i) and (ii) are false
Please explain your answer and what does Assume decomposition includes all the attributes of R mean?
(i) lossless decomposition is always possible for R
(ii) Dependency preserving decomposition is always possible for R.
Assume decomposition includes all the attributes of R. Which of the following is correct?
A) Both (i) and (ii) true
B) (i) is true and (ii) is false
C) (i) is false and (ii) is true
D) Both (i) and (ii) are false
Please explain your answer and what does Assume decomposition includes all the attributes of R mean?
sahilverma:
please mark as brainliest
Similar questions