Data Normalization EXam2

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/19

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

20 Terms

1
New cards

Main goals of data normalization in relational database design. 1-3

  1. represent all necessary entities and relationships.

  2. reduce redundancies

  3. make info retrieval more efficient

2
New cards

What issue can arise from careless splitting of data into separate relations?

Spurious tables and redundant info

3
New cards

What is normalization (justification for splitting relations?

process of breaking down relations into smaller ones to get rid of unwanted properties

4
New cards

First Normal Form (1NF) requirement

it’s attributes are not set-valued

5
New cards

How to convert to 1NF?

“flatten” the relation

6
New cards

What is a full functional dependency? FFD

A FFD is a FD x→y where you cannot drop any attributes from x and still have the FD hold.

7
New cards

What is a prime attribute?

An attribute that is part of an candidate key in the relation

8
New cards

What is 2NF?

1NF and every non prime attribute must depend on the whole primary key

9
New cards

How can we decompose first into multiple 2NF?

Divide the FDs into groups sharing common attributes

10
New cards

What is trivial functional dependency?

An FD x_>Y is trivial when y is in x

11
New cards

What is a superkey

a set of attributes that contain a ck

12
New cards

what is 3NF?

A relation is in 3Nf if for every non trivial FD X→Y X is a superkey or Y is a prime attribute

13
New cards

What is the Boyce Codd Normal form?

3NF but x must be a superkey

14
New cards

What is multivalue dependency?

Let R(XYZ) be a relation. X→Y in R wherever 2 row s and t have the same x values and we must also find rows u and w that

  1. S and U share the same Y

  2. S and W share the same Z

  3. T and U share the same Z

  4. T and W share the same Y

15
New cards

Why are MVDs important?

They explain a more general kind of redundancy than FDs.

16
New cards

What are trivial MVDs?

For MVD x→>Y in a relation, it is trivial if Y is in X or XUY=R.

17
New cards

FDs vs MVDs

An MVD x-»Y in a relation R each value of X determines a set of independent values of Y. In contrast, an FD x→Y specifies that for each value of X, there is a unique corresponding value of Y.

18
New cards

What is 4NF?

If for every non trivial MVD x→>Y in a relation R, X must be a superkey of the relation.

19
New cards

3 4NF time saving theorems

  1. All Non-4NF relations can be decomposed into 2 or more relations

  2. All 4NF relations are also BCNF

  3. A BCNF relation whose CKs are single attrs is also 4NF

20
New cards

What is 5NF?

PJNF( project join NF) for join dependencies that survive after 4NF.