Pages that link to "Item:Q1575132"
From MaRDI portal
The following pages link to Conjunctive query containment revisited (Q1575132):
Displaying 50 items.
- Tractable counting of the answers to conjunctive queries (Q389242) (← links)
- Generic local computation (Q414892) (← links)
- Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons (Q506166) (← links)
- Foundations of semantic web databases (Q532369) (← links)
- On the finite controllability of conjunctive query answering in databases under open-world assumption (Q532372) (← links)
- Determinacy and query rewriting for conjunctive queries and views (Q631757) (← links)
- Conjunctive query containment with respect to views and constraints (Q672739) (← links)
- An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries (Q751264) (← links)
- A more general theory of static approximations for conjunctive queries (Q778535) (← links)
- Rewriting queries using views in the presence of arithmetic comparisons (Q859842) (← links)
- Conjunctive query evaluation by search-tree revisited (Q870265) (← links)
- Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
- A unified theory of structural tractability for constraint satisfaction problems (Q931717) (← links)
- On the power of structural decompositions of graph-based representations of constraint problems (Q969532) (← links)
- Ordering conjunctive queries (Q1060862) (← links)
- Some results on the containment and minimization of (in)equality queries (Q1329422) (← links)
- A comparison of structural CSP decomposition methods (Q1589639) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- It's all a matter of degree. Using degree information to optimize multiway joins (Q1650915) (← links)
- A refined characteristic of minimum contingency set for conjunctive query (Q1699786) (← links)
- Testing bag-containment of conjunctive queries (Q1920218) (← links)
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- Graph theory in Coq: minors, treewidth, and isomorphisms (Q2209536) (← links)
- Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
- The many benefits of putting stack filters into disjunctive or conjunctive normal form (Q2387438) (← links)
- Answering conjunctive queries with inequalities (Q2402612) (← links)
- Regular queries on graph databases (Q2402613) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- Prediction-hardness of acyclic conjunctive queries (Q2581365) (← links)
- (Q3046840) (← links)
- Semantic Acyclicity on Graph Databases (Q3187172) (← links)
- Deciding equivalences among conjunctive aggregate queries (Q3546330) (← links)
- On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay (Q3599072) (← links)
- On Generalization and Subsumption for Ordered Clauses (Q3617035) (← links)
- Tree-Width for First Order Formulae (Q3644741) (← links)
- Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues (Q4911144) (← links)
- Treewidth-two graphs as a free algebra (Q5005163) (← links)
- (Q5020954) (← links)
- (Q5089295) (← links)
- Counting Answers to Existential Questions (Q5091275) (← links)
- \(K_4\)-free graphs as a free algebra (Q5111293) (← links)
- Parametrised Complexity of Satisfiability in Temporal Logic (Q5278205) (← links)
- Database Theory - ICDT 2005 (Q5316599) (← links)
- Block-Sorted Quantified Conjunctive Queries (Q5327428) (← links)
- Size and Treewidth Bounds for Conjunctive Queries (Q5395686) (← links)
- A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
- Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
- (Q5738926) (← links)
- On Horn Conjunctive Queries (Q6104762) (← links)
