The algorithm that takes a set of dependencies and adds one schema at – McqOptions

MCQOPTIONS

1.	The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is
A.	BCNF algorithm
B.	2NF algorithm
C.	3NF synthesis algorithm
D.	1NF algorithm
Answer» E.

Discussion

No Comment Found

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 functional dependency can be tested easily on the materialized view, using the constraints ____________.
The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is
Which of the following relation holds?
R (A,B,C,D) is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition?
What are the desirable properties of a decomposition
A relation is in ____________ if an attribute of a composite key is dependent on an attribute of other composite key.