A Polynomial Time Algorithm for Testing Implications of a Join Dependency and Embodied Functional Dependencies.

A Polynomial Time Algorithm for Testing Implications of a Join Dependency and Embodied Functional Dependencies. Giora Slutzki J. Leuchner L. Miller ACM SIGMOD Conference 1988 17 3 218 224 The problem of deciding whether a full join dependency (JD) join [R] and a set of functional dependencies (FDs) F imply an embedded join dependency (EJD) join [S] is known to be NP-complete. We show that the problem can be decided in polynomial time if S