Database Design Starter Quiz-1

A → B is called a transitive dependency if and only if:

X->Z is said to be partial dependency iff:

Decomposition is called ____________ when the join of the sub relations does not result in the same relation R that was decomposed.

Which of the following is a non-trivial functional dependency:

Given a set of functional dependencies on R (A, B, C, D, E) find the number of candidate keys?

{
  A → B

  BC → E

  DE → A
}

Given a relation R = {A, B, C, D, E, H} and having the following FD’s:

F = {A → BC, CD → E, E → C, D → AEH, ABH → BD, DH → BC}.

The number of candidate keys for the above relation is ______ [in integer].