Normalisation Flashcards

1
Q

What is normalisation?

A

Formal technique for analysing a relation based on its primary key and the functional dependencies between the attributes of that relation.

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

What is lossless decomposition?

A

A decomposition is lossless if R1 union R2 -> (R1 || R2). AKA a join would provide the original relation

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

When is a relation in 1NF?

A

Domains of all attributes in R are atomic, AKA indivisible units.

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

When is a relation in 2NF?

A

Every non-prime attribute is fully functionally dependent on a candidate key (AKA candidate key identifies all attributes) and is in 1NF.

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

How do we go from 1NF to 2NF?

A

Identify partial dependencies that exist on the primary key and remove them by placing them in a new relation

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

When is a relation schema in 3NF?

A

When a non-trivial functional dependency X -> Y in R, at least one is true:
1. X is a superkey of R
2. Each attribute z in y-x is in candidate key of R.
AKA no transitive dependencies.

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

When is a relational schema in BCNF?

A

When a non-trivial functional dependency X -> Y in R, X is a superkey of R

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