Hi everyone,
I'm doing a database paper through Massey extramurally and am having
some difficulty with the process of computing the closure of a set of
attributes given a set of functional dependancies.
The kind of thing that I mean here is given a set of attributes R =
(ABCDE) and a set of functional dependancies S
= { AB ->C, AC->B, D->E}, what is the minimal key for R, and
is it in Boyce-Codd Normal Form or Third Normal Form?
I was wondering if there were any members out there who would be
willing to give me some help with this over the weekend, either by
phone or over coffee somewhere (the coffee's on me, of course!), or
maybe over a beer at the BBQ tomorrow if you can face this stuff at the
end of the day... Please let me know if you are willing to discuss
at the BBQ and I'll ensure that I turn up!
Kind regards
Megan Hieatt
[EMAIL PROTECTED]
385-3830
