Re: Constraints and Functional Dependencies

"Marshall" <marshall.spight_at_gmail.com> wrote in message news:1172304086.527354.319940_at_j27g2000cwj.googlegroups.com...
> I hope no one will mind too much if I take a break from our
> usual sort of discussion and talk about database theory for
> a bit. I feel like free associating about functional dependencies.
>
> I like to consider a system under which there is only one type
> of constraint: a formula of first-order logic. That is to say,
> there are no uniqueness constraints, foreign keys, primary keys,
> etc., except as such can be expressed as FOL formulas.

Can you connect the above to "domain key normal form"? If I understand DKNF correctly,
all of the constraints in a schema that is made up of DKNF tables, all the constraints on the data are a consequence of constraints on domains or on keys.

Could a schema be in DKNF without adhering to your rule about FOL formulas? I'm guessing that a schema might depart from DKNF but still adhere to your rule.

Comments? Received on Mon Feb 26 2007 - 16:38:40 CET