Exam 6: Normalization of Database Tables

Some very specialized applications may require normalization beyond the .

In a(n) diagram, the arrows above the attributes indicate all desirable dependencies.

An attribute that is part of a key is known as a(n) attribute.

Reporting anomalies in a table can cause a multitude of problems for managers and can be fixed through application programming.

In order to meet performance requirements, portions of the database design may need to be occasionally denormalized.

Granularity refers to .

What characteristics do tables that conform to the concept of well-informed relations have?

A table that has all key attributes defined, has no repeating groups, and all its attributes are dependent on the primary key is said to be in .

An ERD is created through an process.

If database tables are treated as though they were files in a file system, the never has a chance to demonstrate its superior data-handling capabilities.

The is central to a discussion of normalization.

Unnormalized database tables often lead to various data redundancy disasters in production databases.

Converting a database format from 1NF to 2NF is a complex process.

A table where all attributes are dependent on the primary key but are independent of each other, and no row contains two or more multivalued facts about an entity is said to be in .

Describe a dependency diagram and explain its purpose.

Data redundancies occur from of data on every row entry.

A dependency of one nonprime attribute on another nonprime attribute is a partial dependency.

It becomes difficult to create a suitable key when the related table uses a composite primary key.

Any attribute that is at least part of a key is known as a .

In the context of partial dependencies, data redundancies occur because every row entry requires duplication of data.