Jonathan Leffler wrote:
> Jan Hidders wrote:
>
>> Jan Hidders wrote:
>>
>>> [...] The usual algorithm that gets you to 3NF in one step (the one
>>> using the minimal cover) splits as little as possible. See for
>>> example sheet 46 on:
>>>
>>> http://cs.ulb.ac.be/cours/info364/relnormnotes.pdf
>>
>>
>> Did anyone notice that this algorithm is actually not correct? Take
>> the following example of a relation R(A,B,C,D,E) with the set of FDs:
>>
>> { AB->C, AB->D, BC->D }
>
>
> You've lost E - was that a mistake in the FD's or in the example relation?
Oops. That's a mistake in the example relation. Sorry about that.
Received on Sat Apr 10 2004 - 03:30:29 CDT
