Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the decomposition of R into R1 (A, B) and R2(C, D) is

Related MCQs

• Relation R with an associated set of functional dependencies, F, is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is
• The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is
• Consider a relation R(A,B,C,D,E) with the following functional dependencies: ABC -> DE and D -> AB The number of superkeys of R is:
• Which of the following has each related entity set has its own schema and there is an additional schema for the relationship set?
• Which of the following has each related entity set has its own schema and there is an additional schema for the relationship set.
• Which of the following has each related entity set has its own schema and there is an additional schema for the relationship set.
• Which of the following has each related entity set has its own schema and there is an additional schema for the relationship set?
• Given the functional dependencies X →W; X→Y; Y→Z and Z→PQ Which of the following doesn’t hold well?
• Functional dependencies are a generalization of
• Functional Dependencies are the types of constraints that are based on