In the context of relational database normalization, which of the following statements is/are true?
View worked solution
Answer: A;B;C
Let us analyze each statement individually:
- Statement A: It is always possible to obtain a dependency-preserving decomposition of a relation.
True. By using the synthesis algorithm, we can always decompose any relation schema into a set of relations that are in while guaranteeing both the lossless-join property and dependency preservation. - Statement B: It is always possible to obtain a dependency-preserving decomposition of a relation.
True. only requires that all attribute values are atomic. Since any relation can be represented in without losing any functional dependencies (the original relation itself with atomic attributes is already in and preserves all its dependencies), a dependency-preserving decomposition is always trivially possible. - Statement C: It is not always possible to obtain a dependency-preserving BCNF decomposition of a relation.
True. While a lossless-join BCNF decomposition is always possible, dependency preservation is not guaranteed.
Counterexample: Consider the relation with functional dependencies:Here, the candidate keys are and . The dependency violates BCNF because is not a superkey. Any BCNF decomposition (such as and ) will fail to preserve the dependency . - Statement D: It is not always possible to obtain a dependency-preserving decomposition of a relation.
False. Every relation in is also in by definition (since is a stricter normal form). Since we can always obtain a dependency-preserving decomposition (as established in Statement A), that same decomposition is guaranteed to be in and preserve all dependencies. Thus, it is always possible to obtain a dependency-preserving decomposition.
Therefore, statements A, B, and C are true.
Free practice · Your answers on this page are not saved.
