Q. If every functional dependency in set E is also in the closure of F then this is classified as

View solution

Q. If there is more than one key for relation schema in DBMS then each key in relation schema is classified as

View solution

Q. 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

View solution

Q. The property of normalization of relations which guarantees that functional dependencies are represented in separate relations after decomposition is classified as

View solution

Q. 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

View solution

Q. The functional dependency of two sets E and F are considered as equivalent if

View solution

Q. The process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as

View solution

Q. Considering the relational database, the functional dependency between two attributes A and B is denoted by

View solution

Q. If the attribute of relation schema R is member of some candidate key then this type of attributes are classified as

View solution

Q. The procedure of storing higher normal form relations which are in lower normal form as a base relation is classified as

View solution

Q. If the attribute of relation schema R is not a member of some candidate key then this type of attribute is classified as

View solution

Q. In the reflexive rule (IR1), the true dependencies generated are classified as

View solution

Q. The extensions of relation that satisfy the constraint of functional dependency are considered as

View solution

Q. If each tuple have relation R within it then this type of relation is classified as

View solution

Q. In normalization of relations, the property which is critical and must be achieved is classified as

View solution

Q. In the functional dependency between two sets of attributes A and B then the set of attributes A of database is classified as

View solution

Q. Considering the functional dependency, the one in which removal of some attributes does not affect dependency is called

View solution

Q. The constraint between two different attributes sets is classified as

View solution

Q. The joining property which guarantees that spurious tuple generation problem is not created after decomposition is called

View solution

Q. The normalization form which is based on the transitive dependency is classified as

View solution