Q. When assessing the table structure of an acquired set of tables with data, counting the number of table rows is (part of) the:

View solution

Q. If a table has been normalized so that all determinants are candidate keys, then that table is in:

View solution

Q. Read-only databases are ________ updated.

View solution

Q. Needing to assess the validity of assumed referential integrity constraints on foreign keys is a(n) ________ of normalization.

View solution

Q. When assessing the table structure of an acquired set of tables with data, determining primary keys is (part of) the:

View solution

Q. Normalization ________ data duplication.

View solution

Q. Each answer below shows example data from a table. Which answer is an example of the inconsistent values problem?

View solution

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