Chapter 8 Flashcards

1
Q

what defines a bad schema?

A

when there is a possibility of repetitions and there may be a need for null values

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

why do we decompose?

A

so we can get to smaller, better schemas that have no repetition of information and no need to use null values

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

what is a lossy decomposition?

A

decompose in which we lose information

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

what is a decomposition that does not result in loss of info

A

lossless join decomposition

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

define decomposition theory

A

decide whether particular relation R is in good form; how to decompose so that each relation is in good form, lossless join decomposition

dependent on functional dependencies and multivalued dependencies

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

define functional dependencies

A

functional dependency is when a –> B

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

when does a relation satisfy F

A

if relation r is legal under a set F of functional dependencies

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

what does holds on mean?

A

we say that F holds on R if all legal relations on R satisfy the set of functional dependencies F

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

define dependency preserving

A

sufficient to test only those depedencies on each individual relation of a decomposition in order to ensure that all functional dependencies hold

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