• Tom.Thomson (7/14/2011)


    Lempster (7/14/2011)


    I must admit that I got a bit lost by the description in your first paragraph, but the example that you gave made it clear and confirmed to me that 2NF was what I thought it was - phew!

    Thanks very much, looking forward to 3NF and beyond...

    Thanks for that.

    I should have used a betterl description (the form of words I used was pretty poor). Something like "If X is a set of prime attributes and A is a non-prime attribute and the value of A is determined by the values of X then X contains the whole of at least one candidate key". Your comment made me read that first paragraph again and I found it confusing me this time and I'm not sure what I wrote is actually right (it looks a bit too much like a definition of 3NF).

    EDIT: I provided Steve with new text for the definition and it is now incorporated in teh article. Thanks' Lemperer, for helping make this a better article.

    TOM: I have never seen 2NF explained without a VIN diagram or a Set Diagram before. Not Bad. Mere mortals might have grasped this faster with a Set diagram, but the examples and descriptions taught the reader what this is in Data Relation theory, not Set math. NICE! 😎