Need help on Functions Dependency problems, Urgent!!!
From: lordsofring <lordsofring_at_yahoo.com>
Date: 10 Nov 2002 20:12:41 -0800
Message-ID: <598f6e78.0211102012.12406ffc_at_posting.google.com>
I'm a newbie on function dependency problem, currently working on the following questions, but havn't got a clue. Anyone can solve this will be highly apprieciated.
Date: 10 Nov 2002 20:12:41 -0800
Message-ID: <598f6e78.0211102012.12406ffc_at_posting.google.com>
I'm a newbie on function dependency problem, currently working on the following questions, but havn't got a clue. Anyone can solve this will be highly apprieciated.
F = {A->B, C->D, AC->E, B->E, CE->A, BD->C} is a set of function dependencies on S (ABCDEF)
- Find all the candidate keys of S regarding to F.
- Find a cover for F+|ABCD, F+ is the closure of F.
- Find a BCNG and loss less join decomopsetion for S. explain the procedure
- Does the BCNF and loss less join decomposition in (3) preserve the set F of fd's?
Anyone can figure out these?
THX.
Received on Mon Nov 11 2002 - 05:12:41 CET