Chapter 8 Flashcards
what defines a bad schema?
when there is a possibility of repetitions and there may be a need for null values
why do we decompose?
so we can get to smaller, better schemas that have no repetition of information and no need to use null values
what is a lossy decomposition?
decompose in which we lose information
what is a decomposition that does not result in loss of info
lossless join decomposition
define decomposition theory
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
define functional dependencies
functional dependency is when a –> B
when does a relation satisfy F
if relation r is legal under a set F of functional dependencies
what does holds on mean?
we say that F holds on R if all legal relations on R satisfy the set of functional dependencies F
define dependency preserving
sufficient to test only those depedencies on each individual relation of a decomposition in order to ensure that all functional dependencies hold