Key-equivalence of functional dependency statements systems

What is it about?

We consider the relational data model and formulate the key-finding problem in the paper. Based on a graph-theory formalism we prove the theorem which gives the necessary and sufficient condition to claim that a system of functional dependencies DEP is key-equivalent to a linear system of functional dependencies created from DEP.

Featured Image