FD Theory Questions:

(1) Consider R = BOSQID and F = { S --> D, I --> B, IS --> Q, B --> O }.
    (a) List all candidate keys for R,F.
    (b) Obtain a 3NF decomposition of R satisfying the LJD and FDP properties.

(2) Consider R = ABCDE and F = { A --> C, BD --> E, B --> D, B --> E, C --> AD }.
    (a) Obtain a minimal cover for F.
    (b) List all the candidate keys for F.
    (c) Obtain a 3NF decomposition of R satisfying the LJD and FDP properties.

(3) Using only the Armstrong's axioms, prove that 

    if X --> Y and U --> V hold then XU --> YV holds.

(4) Are the following two sets of FDs equivalent? Show your work and
    give reasons why or why not.

    F = { AB --> C, B --> C, A --> D }
    G = { A --> B, B --> C, C --> D }

(5) Given F = { AB --> E, BE --> I, E --> C, CI -->  D }

    Prove that AB --> CD is derivable from F. 

TRC/DRC/Datalog Questions:

Write expressions in DRC, TRC, and Datalog for the queries in exam 2, problem 1.