Results 1 to 2 of 2
  1. #1
    Join Date
    Nov 2010

    help with functional dependency / candidate keys

    Hi guys I have the following assignment to solve :
    1. Let schema R = (A;B;C;D;E), with the following set of functional dependencies F:
    A →BC
    EB → C
    CD → E
    B → D
    E → A
    (a) List all candidate keys for R (4 points).

    I don't want the solution just an explanation where should I start . what is the algorithm for find the candidate keys ? should I use Armstrongs' axioms and list the atributtes that appear on L.H.S. and R.H.S. or ????


  2. #2
    Join Date
    Feb 2004
    One Flump in One Place
    Moving to DB Concepts
    pootle flump
    ur codings are working excelent.

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts