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

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. The rule that always generate true dependencies is called

View solution