Hesse pencil

A canonical cover $F_{c}$ for F (a set of functional dependencies on a relation scheme) is a set of dependencies such that F logically implies all dependencies in $F_{c}$, and $F_{c}$ logically implies all dependencies in F.

The set $F_{c}$ has two important properties:

1. No functional dependency in $F_{c}$ contains an extraneous attribute.
2. Each left side of a functional dependency in $F_{c}$ is unique. That is, there are no two dependencies $a\to b$ and $c\to d$ in $F_{c}$ such that $a=c$.

Algorithm for computing a canonical cover

1. $F_{c}=F$
2. Repeat:
   1. Use the union rule to replace any dependencies in $F_{c}$ of the form $a\to b$ and $a\to d$ with $a\to bd$.
   2. Find a functional dependency in $F_{c}$ with an extraneous attribute and delete it from $F_{c}$
3. ... until $F_{c}$ does not change

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.