Normalization Flashcards

1
Q

A technique for producing a set of relations with desirable properties, given the data requirements of an enterprise.

A

Normalization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

occurs when a user who wants to insert data about one real-world entity is forced to enter data about another real-world entity.

A

Insertion anomaly

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

occurs when a user who wants to delete data about a real-world entity is forced to delete data about another real-world entity.

A

Deletion anomaly

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

occurs when, in order to modify one value, the same modification has to be made multiple times.

A

Modification anomaly

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

The sets of rules to eliminate
anomalies, and produce a new
collection of problem-free tables.

A

Normal forms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Types of Normal Forms

A
  • First Normal Form (1NF)
  • Second Normal Form (2NF)
  • Third Normal Form (3NF)
  • Boyce-Codd Normal Form (BCNF)
    Normalization
  • Fourth Normal Form (4NF)
  • Fifth Normal Form (5NF)
  • Domain Key Normal Form (DKNF)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Describes the relationship between
attributes in a relation.

A

Functional dependency

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

An attribute or collection of attributes whose values determine the values of another attribute.

A

determinant

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Indicates that if A and B are attributes of a relation, B is fully functionally dependent on A if B is functionally dependent on
A, but not on any proper subset of
A.

A

Full Functional Dependency

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

A condition where A, B and C are attributes of a relation such that A -> B and B -> C, then C is transitively dependent on A via B (provided that A is not functionally dependent on B or C).

A

Transitive Dependency

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

A table or relation is in ________ if it contains a repeating group.

A

Unnormalized Form

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

An attribute or group of attributes within a table that occurs with multiple values for a single occurrence of the nominated key attribute(s) for that table.

A

Repeating Group

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

A table or relation is in ________ if it does not contain repeating groups.

A

First Normal Form

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

A table or relation is in _________ if it is in 1NF and every non-key attribute is fully functionally dependent on the primary key (no partial dependencies).

A

Second Normal Form

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

A table or relation is in ____________ if it is in 2NF and no non-key attribute is transitively
dependent on the primary key.

A

Third Normal Form

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

An attribute or collection of
attributes that has all the required
characteristics of a primary key.

A

Candidate key

17
Q

A table or relation is in __________ if and only if every determinant is a candidate key.

A

Boyce-Codd Normal Form