The implication problem for inclusion dependencies
Rokia Missaoui, Robert P. Godin · ACM SIGMOD Record · 1990
In this paper, we propose a graph theoretic approach to deal with the implication problem for inclusion dependencies. By analogy with functional dependencies, we define and present algorithms for computing the following concepts: the closure of a relation scheme R for X according to a set of inclusion dependencies and the minimal cover for inclusion dependencies.