Re: BCNF: superkey or candidate key ?

From: <>
Date: Sun, 24 Sep 2006 23:49:13 GMT
Message-ID: <>

"Database In Depth", C.J. Date, May 2005, p.140: Relvar R is in BCNF if and only if, for every nontrivial FD A -> B satisfied by R, A is a superkey for R.

"Database Modeling and Design", 4th Ed., Torey/Lightstone/Nadeau, Sep 2005, p.115:
A table R is in Boyce-Codd normal form (BCNF) if for every nontrivial FD X
-> A, X is a superkey.

"Fundamentals of Database Systems", 5th Ed., Elmasri/Navathe, May 2006, p.368:
A relation schema R is in BCNF if whenever a nontrivial functional dependency X -> A holds in R, then X is a superkey of R.

----== Posted via Newsfeeds.Com - Unlimited-Unrestricted-Secure Usenet News==---- The #1 Newsgroup Service in the World! 120,000+ Newsgroups ----= East and West-Coast Server Farms - Total Privacy via Encryption =---- Received on Mon Sep 25 2006 - 01:49:13 CEST

Original text of this message