Question 11482 – APPSC-2012-DL CA
March 27, 2024Question 11485 – APPSC-2012-DL CA
March 27, 2024Database-Management-System
|
Question 368
|
Let the functional dependencies, (A → B, B → C) hold for relation P(A,B,C). If it is decomposed in R(A,B) and S(B,C), then the decomposition will be
|
Lossy
|
|
|
Lossless
|
|
|
Non-Lossless
|
|
|
Strongly
|
Question 368 Explanation:
The decomposition is lossless because B is common attribute and is a key in relation S ,so the decomposition is lossless.
Correct Answer: B
Question 368 Explanation:
The decomposition is lossless because B is common attribute and is a key in relation S ,so the decomposition is lossless.