Pages that link to "Item:Q909447"
From MaRDI portal
The following pages link to Decomposing a relation into a tree of binary relations (Q909447):
Displaying 12 items.
- Approximate inference of functional dependencies from relations (Q672339) (← links)
- Decomposition of k-ary relations (Q751668) (← links)
- A unique formal system for binary decompositions of database relations, probability distributions, and graphs (Q1177386) (← links)
- Structure identification in relational data (Q1204870) (← links)
- A generic disjunctive/conjunctive decomposition model for \(n\)-ary relations (Q1283554) (← links)
- Decomposing constraint satisfaction problems using database techniques (Q1321054) (← links)
- Fuzzy functional dependencies and Bayesian networks (Q1400037) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Decomposability of partially defined Boolean functions (Q1900137) (← links)
- Unifying tree decompositions for reasoning in graphical models (Q2457660) (← links)
- Uncovering trees in constraint networks (Q2676569) (← links)
- Implicit representation of relations (Q6185606) (← links)