adplus-dvertising
frame-decoration

Question

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

a.

E + F = E - F

b.

E * = F 2

c.

E 2 = F 2

d.

E * = F *

Posted under DBMS

Answer: (d).E * = F *

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Q. Considering the functional dependency, the one in which removal from some attributes must affect dependency is called

Q. The normal form which only includes indivisible values or single atomic values is classified as

Q. The concept in normalization of relations which is based on the full functional dependency is classified as

Q. In the tuples, the interpretation of the values of the attribute is considered as

Q. The rule which states that set of attributes determines any of its subset is classified as

Q. The rule that always generate true dependencies is called