Scribd Logo
Upload

Welcome to Scribd!

  • Trivial and Non

    Uploaded by

    Jitendra Patel
    4 views1 page
    A set of functional dependencies (FDs) can be either trivial or non-trivial. An irreducible set of FDs is a set where no FD can be removed without losing information about the dependencies between attributes.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A set of functional dependencies (FDs) can be either trivial or non-trivial. An irreducible set of FDs is a set where no FD can be removed without losing information about the dependencies between attributes.

    Copyright:

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

    Trivial and Non

    Uploaded by

    Jitendra Patel
    A set of functional dependencies (FDs) can be either trivial or non-trivial. An irreducible set of FDs is a set where no FD can be removed without losing information about the dependencies between attributes.

    Copyright:

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

    Trivial and non-trivial FD

    Set
    Irreducible set of FD

    You might also like