Q. When assessing the table structure of an acquired set of tables with data, accessing the validity of possible referential integrity constraints on foreign keys is (part of) the:

View solution

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

View solution

Q. Creating a read-only database is a task that is ________ assigned to beginning database professionals.

View solution

Q. Each answer below shows example data from a table. Which answer is an example of the general-purpose remarks column problem?

View solution

Q. For a number of reasons, normalizations is not often an advantage for a(n) ________ database.

View solution

Q. Most of the time, modification anomalies are serious enough that tables should be normalized into:

View solution

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

View solution

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

View solution

Q. Each answer below shows example data from a table. Which answer is an example of the multivalue, multicolumn problem?

View solution

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