a) BCNF is stricter than 3 NF
b) Lossless, dependency -preserving decomposition into 3 NF is always possible
c) Loss less, dependency – preserving decomposition into BCNF is always possible
d) Any relation with two attributes is BCNF
Answer: c
Explanation: We say that the decomposition is a lossless decomposition if there is no loss of information by replacing r (R) with two relation schemas r1(R1) andr2(R2).
Related Posts
Empdt1(empcode, name, street, city, state, pincode).
For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode. In normalization terms, empdt1 is a relation inWhich forms are based on the concept of functional dependency:
Which forms has a relation that possesses data about an individual entity:
Which forms simplifies and ensures that there are minimal data aggregates and repetitive groups:
Which is a bottom-up approach to database design that design by examining the relationship between attributes:
Functional Dependencies are the types of constraints that are based on______
Tables in second normal form (2NF):
Join The Discussion