Re: Searching for algorithm

From: Jan Hidders <>
Date: 2000/09/21
Message-ID: <8qcgoe$jk1$>#1/1

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:

Kind regards,

    Jan Hidders
Received on Thu Sep 21 2000 - 00:00:00 CEST

Original text of this message