Directions (Q96–100): An organization maintains a database with five attributes A, B, C, D, E. Consider the universal relation R(A, B, C, D, E) with functional dependency set F = {A → BC, D → E, BC → D, A → D}. All attributes are simple and atomic.
Assume that given table R is decomposed in two tables R (A, B, C) 1 with functional dependency set f = {A → B, A → C} 1 and R (A, D, E) FD 2 with set F = {A → D, D → E} 2 . Which of the following option is true w.r.t. given decomposition?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. R1 is in 3NF and R2 is in 2NF
Explanation
R1(A, B, C) has only A → B, A → C, so it is in 3NF (even BCNF). R2(A, D, E) has A → D → E, a transitive dependency, so it is only in 2NF. BC → D is lost, so dependencies are not preserved.
More Database Management Systems questions
- Which of the following has same expressive power with regard to relational query language? (a) Relational algebra and domain relational cal…
- Which of the following features is supported in the relational database model?
- With respect to relational algebra, which of the following operations are included for mathematical set theory? (a) Join (b) Intersection (…
- In relational databases, if relation is in , then which of the following is true about relation R ?
- Which of the following key constraints is required for functioning of foreign key in the context of relational databases?
- In relational database management, which of the following is/are property/properties of candidate key? P : Uniqueness Q : Irreducibility