Transcribed TextTranscribed Text

Homework 3: Functional Dependencies 1. Given a relation R(E,F,G,H) and the set of functional dependencies S = {E →F, EG →H, EF →G}: a. Find E + b. Is E a candidate key? Please explain your answer. 2. Given a relation R(A, B, C, G, H, I) and the set of functional dependencies S = {A → B, A → C, CG → H, CG → I, B → H} a. Find (AG)+ b. Is AG a candidate key? Please explain your answer. 3. Consider the relation schema R(A,B,C), which has the FD: B → C. If A is a candidate key for R, is it possible for R to be in BCNF? If so, under what conditions? If not, explain why not. 4. a. List all the functional dependencies that the following relation instance satisfies: b. Assume that the value of attribute Z of the last record in the relation is changed from z3 to z2. Does your list of all the functional dependencies in (a) change? 5. Suppose that we have the following three tuples in a valid instance of a relation schema R with three attributes (A,B,C): (1,6,7), (4,6,7), and (5,7,7). Specify whether each of the following FDs holds over R? (a) A → B (b) BC → A (c) B → C

Solution PreviewSolution Preview

This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.

    $40.00 for this solution

    PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

    Find A Tutor

    View available Database Development Tutors

    Get College Homework Help.

    Are you sure you don't want to upload any files?

    Fast tutor response requires as much info as possible.

    Upload a file
    Continue without uploading

    We couldn't find that subject.
    Please select the best match from the list below.

    We'll send you an email right away. If it's not in your inbox, check your spam folder.

    • 1
    • 2
    • 3
    Live Chats