A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
On the Complexity of Testing Implications of Functional and Join Dependencies
Journal of the ACM (JACM)
A Complete Axiomatization of Full Join Dependencies
Journal of the ACM (JACM)
Syntactic Characterization of Tree Database Schemas
Journal of the ACM (JACM)
Embedded join dependencies as a tool for decomposing full join dependencies
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Principles of Database Systems
Principles of Database Systems
Data Models
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Graphs and Hypergraphs
Theory of Relational Databases
Theory of Relational Databases
A universal relation language interface for INGRES
CSC '91 Proceedings of the 19th annual conference on Computer Science
| Hi-index | 0.00 |
The problem of deciding whether a full join dependency (JD) ⋈ [R] and a set of functional dependencies (FDs) F imply an embedded join dependency (EJD) ⋈ [S] is known to be NP-complete. We show that the problem can be decided in polynomial time if S ⊆ R and F is embedded in R. Our work uses arguments based on an extension of complete intersection graphs rather than tableaus. This approach has facilitated our results and should prove useful for future research.