Pages that link to "Item:Q3028374"
From MaRDI portal
The following pages link to Syntactic Characterization of Tree Database Schemas (Q3028374):
Displayed 20 items.
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
- Arboricity: an acyclic hypergraph decomposition problem motivated by database theory (Q765344) (← links)
- GYO reductions, canonical connections, tree and cyclic schemas, and tree projections (Q801698) (← links)
- On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
- NP-complete problems simplified on tree schemas (Q1056539) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- The tree projection theorem and relational query processing (Q1061514) (← links)
- Existence of extensions and product extensions for discrete probability distributions (Q1098477) (← links)
- On hypergraph acyclicity and graph chordality (Q1114449) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- A characterization of finite fd-acyclicity (Q1264004) (← links)
- A comparison of structural CSP decomposition methods (Q1589639) (← links)
- Split-freedom and MVD-intersection: A new characterization of multivalued dependencies having conflict-free covers (Q1823739) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- Weighted 2-sections and hypergraph reconstruction (Q2143117) (← links)
- An algorithm for determining minimal reduced-coverings of acyclic database schemes (Q2365507) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
- A REVIEW OF TREE CONVEX SETS TEST (Q4649838) (← links)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems (Q5283239) (← links)
- Dually chordal graphs (Q6143980) (← links)