Program to find canonical cover or minimum number of functional dependencies

Posted by Sev on Stack Overflow See other posts from Stack Overflow or by Sev
Published on 2010-05-12T21:15:06Z Indexed on 2010/05/12 21:34 UTC
Read the original article Hit count: 351

I would like to know if there is a program or algorithm to find canonical cover or minimum number of functional dependencies?

For example:

If you have: R = (A,B,C) <-- these are tables: A,B,C

And dependencies:

A ? BC

B ? C

A ? B

AB ? C

The canonical cover (or minimum number of dependencies) is:

A ? B

B ? C

Is there a program that can accomplish this? If not, any code/pseudocode to help me write one would be appreciated. Prefer in Python or Java.

© Stack Overflow or respective owner

Related posts about database-design

Related posts about database