| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: Enforcing functional dependecy constraints
"paul c" <toledobythesea_at_oohay.ac> wrote in message
news:eY6mf.71805$ki.39213_at_pd7tw2no...
> David Cressey wrote:
> > "paul c" <toledobythesea_at_oohay.ac> wrote in message
> > news:WwKlf.63515$ki.5786_at_pd7tw2no...
> >
> >>paul c wrote:
> >>
> >>>...
> >>>
> >>>I agree with David but also I guess that the above comes down to saying
> >>>that BCNF is possible either with S(A,C) and T(C,B) or with U(A,B) and
> >>>T(C,B), assuming that C is a key.
> >>>
> >>
> >>Oops, meant to say "assuming C is a key of T".
> >>
> >>
> >>p
> >
> >
> > I don't see how to reconstruct R (A,B,C) from U(A,B) and T(C,B)
> >
> >
> >
> >
>
> >
> >
> >
To tell the truth, when you get beyond 3NF, I'm dealing with theory rather than practice. And theory is not my strength.
The reason I waited for several days was to see what other people, maybe better trained than I, would do with the "elementary problem" that x posed.
All I was working on in this problem was "every determinant is a candidate
key". That led me to T(C,B).
One I factored that out, All I was left with was S(A,C). As nearly as I
can tell, the determinant of S is the entire relation.
Received on Fri Dec 09 2005 - 06:40:31 CST
![]() |
![]() |