Scribd Logo
Upload

Welcome to Scribd!

  • HW FD

    Uploaded by

    Sou Sopheap Sspp
    3 views1 page
    The document provides instructions for normalizing tables from first normal form to third normal form based on functional dependencies. It includes examples of relations with attributes and sets of functional dependencies. The tasks are to identify candidate keys and decompose the relations into third normal form based on eliminating transitive dependencies.

    Original Description:

    Original Title

    HW_FD

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides instructions for normalizing tables from first normal form to third normal form based on functional dependencies. It includes examples of relations with attributes and sets of functional dependencies. The tasks are to identify candidate keys and decompose the relations into third normal form based on eliminating transitive dependencies.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    3 views1 page

    HW FD

    Uploaded by

    Sou Sopheap Sspp
    The document provides instructions for normalizing tables from first normal form to third normal form based on functional dependencies. It includes examples of relations with attributes and sets of functional dependencies. The tasks are to identify candidate keys and decompose the relations into third normal form based on eliminating transitive dependencies.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    FD EXERCISE

    1. Consider the following table History which shows all details of a patient's attendance at a clinic.
    History (patientNum, name, address, (date, time, drNum, drName,visitCode, description))

    The following dependencies apply:


    patientNum --> name patientNum --> address patientNum, date, time --> drNum

    (doctor number)

    patientNum, date, time --> visitCode (code to describe the consultation) patientNum, date, time --> description (concise description drNum ---> drName

    of consultation) (doctor name)

    Transform the above History table into 3NF table(s)


    2. Given a relation R(A,B,C,D,E) and a set of functional dependencies F = { A B, BC E, ED A} a. Finding a candidate key b. Transform this relation into 3NF relation(s) 3. Given a relation R(A,B,C,D). For each following sets of functional dependencies, a. Hy tm kha ti thiu ca R. b. Finding a candidate key c. Transform this relation into 3NF relation(s) i. ii. iii. iv. C D, C A, B C ABC D, D A A B, BC D, A C AB C, AB D, C A, D B

    You might also like