Normalization

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/28

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 2:14 PM on 4/9/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

29 Terms

1
New cards

Normalization

technique used to produce suitable relations that support enterprise data requirements to minimize data redundancy and create accurate representations in data, its relationships, and constraints

2
New cards

Lossless-join property

find any instance in the original relation from corresponding instances in the smaller relations

3
New cards

Dependency Preservation Property

enforce constraints on original relation by enforcing them on each of the smaller ones

4
New cards

Insertion anomaly

Difficulties/inconsistencies that arise when attempting adding new data in DB

5
New cards

Deletion Anomaly

unintended loss of data when a deleting a row in DB

6
New cards

Modification Anomaly

data inconsistencies when updating data that appears in multiple places

7
New cards

Functional dependency

If B is fully dependent on A, every value in A is associated with 1 value in B

8
New cards

Determinant

attribute on left hand side of functional dependacy

9
New cards

Full functional dependency

B is fully functional dependent if functionally dependent on A but not a proper subset of A

10
New cards

Partial Dependent

attribute is functionally dependent on subset of primary key

11
New cards

Transitive Dependency

When A determines B and B determines C, C is transitive dependent on A via B

12
New cards

Multi-valued dependency

for each value of A, there is a set of values for B and C, but B and C are independent of each other

13
New cards

Join Dependency

Every legal values is equal to the join of its projections

14
New cards

Reflexivity

If B is a subset of A, then A -> B

15
New cards

Augmentation

If A → B, AC → BC (adding same attribute to each side)

16
New cards

Transitivity

If A → B and B → C, A → C

17
New cards

Self Determination

A → A

18
New cards

Decomposition

If A → B, C, A → B and A → C (determinant pointing to multiple attributes can have them broken down)

19
New cards

Union

A → B and A → C, A → B, C

20
New cards

Composition

If A → B and C→ D, A, C → B, D (2 separate dependencies can combine their determinants and dependents

21
New cards

UNF

table containing 1 or more repeating groups

22
New cards

1NF

relations where intersection of each row/column contains one value and all repeating groups are removed

23
New cards

2NF

1NF relations and every nonprimary key attribute is fully functionally dependent on the primary key by removing partial dependencies

24
New cards

3NF

2NF relations where no nonprimary key attribute is transitively dependent on the primary key

25
New cards

BCNF

relation where every determinant is a candidate key

26
New cards

4NF

BCNF relation without containing nontrivial multi-valued dependency

27
New cards

5NF

relation with no join dependency

28
New cards

3NF vs BCNF

Every relation in BCNF is also in 3NF, but a relation in 3NF may not be in BCNF.

29
New cards

Partial Dependency vs. Transitive Dependency

Partial dependencies violate 2NF and occur when attributes depend on only a portion of the primary key. Transitive dependencies violate 3NF and occur when a non-key attribute depends on another non-key attribute, which in turn depends on the primary key.