Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: The "standard" way to get to 3NF

Re: The "standard" way to get to 3NF

From: Jan Hidders <jan.hidders_at_REMOVETHIS.pandora.be>
Date: Thu, 15 Apr 2004 19:43:05 GMT
Message-ID: <dBBfc.72339$xu1.4779068@phobos.telenet-ops.be> 





Dan wrote:


> 

> Date in his *Intro* textbook also demonstrates finding minimal cover

> using Armstrong's axioms (versus the algorithm), correct?




I'm not sure what you mean by "versus the algorithm", or do you mean 
"for the algorithm"? He does indeed use the the concept of minimal cover 
and calls it an irreducible cover, and uses it to present the algorithm 
for getting to 3NF in one step.




Received on Thu Apr 15 2004 - 14:43:05 CDT












Original text of this message













  HOME |
  ASK QUESTION |
  ADD INFO |
  SEARCH |
  E-MAIL US