Chapter 7 Flashcards

1
Q

What is an insertion anomaly?

A

Occurs when extra data beyond the desired data must be added to the database.

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

What is an update anomaly?

A

Occurs when it is necessary to change multiple rows to modify only a single face

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

What is a deletion anomaly?

A

Occurs whenever deleting a row inadvertently causes other data to be deleted.

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

What is the cause of modification anomalies?

A

Poor DB design causes the modification anomaly, A good DB design avoids modification anomalies by eliminating excessive redundancies

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

What is normalization?

A
Is the (conceptual and theoretical) process of removing redundancy in a table so that the table does not have modification anomalies
It is not practical - using normalization you can judge, but cannot build a database
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is a functional dependency?

A

A constraint about two or more columns of a table. X determines Y (X –> Y) if there exists at most one value of Y for every value of X

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

How is it like a candidate key? (a functional dependency)

A

You can think about functional dependency as identifying potential candidate keys. By stating that X–> Y, if X and Y are placed together in a table without other columns, X is a candidate key. Every determinant (LHS) is a candidate key if placed in a table with the other columns that it determines

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

What is the meaning of tan FD with multiple columns on the right-hand side?

A

Multiple columns on the RHS abbreviate separate FDs with the LHS determine each of the RHS columns

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

Why be careful when writing FDs with multiple columns on the left-hand side?

A

Multiple columns on the LHS indicate that the combination of columns determines the RHS columns. You should be careful that you have written the LHS with the minimal columns for the dependency. Otherwise, the normalization rules and sw procedures may not work as intended. Writing an FD with extra columns in the LHS is the same as writing a candidate key with extra columns. Both will lead to incorrect DB constraints.

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

What is a normal form?

A

rule about allowable dependencies. Each normal form removes certain kinds of redundancies

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

What does 1NF prohibit?

A

1NF prohibits nesting or repeating groups in tables. A table not in 1NF is unnormalized or non-normalized

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

What FDs are not allowed in 2FN? 3FN?

A

FDs in which part of a key determines a nonkey column

FDs in which a nonkey column determine another nonkey column

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

What are partial FDs?

A

Non-key attributes are dependent on not only the whole but also a part of the composite key

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

Combined definition of 2NF and 3NF?

A

A table is in 3NF if every nonkey column is dependent on a candidate key, the whole candidate key, and nothing but candidate keys

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

Splitting a 2NF table?

A

Allnon-key FDssharing a common determinant must become a new table
Remove dependents of all non-key FDsfrom the original table.

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

Splitting a 3NF table?

A

All non-key FDs with key dependents sharing a common determinant must become a new table

17
Q

FDs not allowed in BCNF?

A

FDs in which the determinant is not a candidate key

18
Q

Two concepts in BCNF definition?

A

A table is said to be BCNF when it satisfies the below two concepts-
It is in 3NF.
For any functional dependency A->B, A should be a super key or a candidate key. In other words, if B is a prime attribute, A cannot be a non-prime attribute.

19
Q

Why is the BCNF definition preferred to the original 3NF definition?

A

because it’s a simpler definition and provides the basis for the simple synthesis algorithm