Re: Searching for algorithm

moon wrote:
> I looking for a algorithm to calculate the closure of a Set of FDs

Algorithm 1:

Apply Armstrong's rules until no more new dependencies are added.

Algorithm 2:

Let S be an empty set of functional dependencies. For every set X of attributes (in the relation) do: - determine X+ (the closure of X)
- For every Y that is a subset of X+ do:

• add X --> Y to S Return S

For details (Armstrong's rules and computing the closure of a set of attributes) see:

  http://www.cis.ohio-state.edu/~gurari/course/cis670/cis670Ch10.html

-- 
Kind regards,

    Jan Hidders