The form of dependency in which the set of attributes that are neither a subset of any of the keys nor the candidate key is classified as ____________
The form of dependency in which the set of attributes that are neither a subset of any of the keys nor the candidate key is classified as ____________
If each tuple have relation R within it then this type of relation is classified as ________________
If each tuple have relation R within it then this type of relation is classified as ________________
If there is more than one key for relation schema in DBMS then each key in relation schema is classified as ___________________
If there is more than one key for relation schema in DBMS then each key in relation schema is classified as ___________________
If the attribute of relation schema R is member of some candidate key then this type of attributes are classified as _________________
If the attribute of relation schema R is member of some candidate key then this type of attributes are classified as _________________
The rule that always generate true dependencies is called ________________
The rule that always generate true dependencies is called ________________
The rule which states that set of attributes determines any of its subset is classified as ________________
The rule which states that set of attributes determines any of its subset is classified as ________________
The joining property which guarantees that spurious tuple generation problem is not created after decomposition is called _________________
The joining property which guarantees that spurious tuple generation problem is not created after decomposition is called _________________
In the functional dependency between two sets of attributes A and B then the set of attributes A of database is classified as ______________
In the functional dependency between two sets of attributes A and B then the set of attributes A of database is classified as ______________
Which of the following is not Armstrong’s Axiom?
Which of the following is not Armstrong’s Axiom?
If every functional dependency in set E is also in the closure of F then this is classified as ____________--
If every functional dependency in set E is also in the closure of F then this is classified as ____________--
The procedure of storing higher normal form relations which are in lower normal form as a base relation is classified as _______________
The procedure of storing higher normal form relations which are in lower normal form as a base relation is classified as _______________
Considering the functional dependency, the one in which removal of some attributes does not affect dependency is called ___________
Considering the functional dependency, the one in which removal of some attributes does not affect dependency is called ___________
The normalization form which is based on the transitive dependency is classified as ______________
The normalization form which is based on the transitive dependency is classified as ______________
The property of normalization of relations which guarantees that functional dependencies are represented in separate relations after decomposition is classified as __________________
The property of normalization of relations which guarantees that functional dependencies are represented in separate relations after decomposition is classified as __________________
In normalization of relations, the property which is critical and must be achieved is classified as _______________
In normalization of relations, the property which is critical and must be achieved is classified as _______________
The rule which states that addition of same attributes to the right side and left side will results in other valid dependency is classified as ____________
The rule which states that addition of same attributes to the right side and left side will results in other valid dependency is classified as ____________
If the attribute of relation schema R is not a member of some candidate key then this type of attribute is classified as ______________
If the attribute of relation schema R is not a member of some candidate key then this type of attribute is classified as ______________
The extensions of relation that satisfy the constraint of functional dependency are considered as ____________
The extensions of relation that satisfy the constraint of functional dependency are considered as ____________
The process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as ______________
The process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as ______________
The constraint between two different attributes sets is classified as __________________
The constraint between two different attributes sets is classified as __________________