Conjunctive query containment revisited
From MaRDI portal
Recommendations
Cites work
- A linear time algorithm for finding tree-decompositions of small treewidth
- Answering queries using limited external query processors
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Complexity of Finding Embeddings in a k-Tree
- Equivalences among Relational Expressions
- scientific article; zbMATH DE number 1256750 (Why is no real title available?)
- Optimization of a subclass of conjunctive queries
- Optimizing Conjunctive Queries that Contain Untyped Variables
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Zero knowledge and the chromatic number
Cited in
(63)- Ordering conjunctive queries
- Some results on the containment and minimization of (in)equality queries
- A comparison of structural CSP decomposition methods
- Conjunctive-query containment and constraint satisfaction
- It's all a matter of degree. Using degree information to optimize multiway joins
- A refined characteristic of minimum contingency set for conjunctive query
- Testing bag-containment of conjunctive queries
- Pruning external minimality checking for answer set programs using semantic dependencies
- Graph theory in Coq: minors, treewidth, and isomorphisms
- Large hypertree width for sparse random hypergraphs
- The many benefits of putting stack filters into disjunctive or conjunctive normal form
- Answering conjunctive queries with inequalities
- Regular queries on graph databases
- The price of query rewriting in ontology-based data access
- Prediction-hardness of acyclic conjunctive queries
- Semantic acyclicity for conjunctive queries: approximations and constraints
- Proceedings of the 17th international conference on database theory, ICDT 2014, Athens, Greece, March 24--28, 2014
- scientific article; zbMATH DE number 2089444 (Why is no real title available?)
- Semantic acyclicity on graph databases
- Deciding equivalences among conjunctive aggregate queries
- On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
- On Generalization and Subsumption for Ordered Clauses
- Tree-Width for First Order Formulae
- Tractable counting of the answers to conjunctive queries
- Generic local computation
- scientific article; zbMATH DE number 1953127 (Why is no real title available?)
- scientific article; zbMATH DE number 1953142 (Why is no real title available?)
- scientific article; zbMATH DE number 2080453 (Why is no real title available?)
- scientific article; zbMATH DE number 2080467 (Why is no real title available?)
- A negative conjunctive query is easy if and only if it is beta-acyclic
- scientific article; zbMATH DE number 219223 (Why is no real title available?)
- Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
- Treewidth-two graphs as a free algebra
- scientific article; zbMATH DE number 7453972 (Why is no real title available?)
- Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons
- scientific article; zbMATH DE number 7559485 (Why is no real title available?)
- Counting Answers to Existential Questions
- scientific article; zbMATH DE number 7204410 (Why is no real title available?)
- Parametrised complexity of satisfiability in temporal logic
- Database Theory - ICDT 2005
- Foundations of semantic web databases
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- Block-Sorted Quantified Conjunctive Queries
- Size and treewidth bounds for conjunctive queries
- A Logical Approach to Constraint Satisfaction
- Uniform Constraint Satisfaction Problems and Database Theory
- scientific article; zbMATH DE number 6729737 (Why is no real title available?)
- An algorithmic framework for locally constrained homomorphisms
- On Horn Conjunctive Queries
- Rewriting with Acyclic Queries: Mind Your Head
- Determinacy and query rewriting for conjunctive queries and views
- An algorithmic framework for locally constrained homomorphisms
- Conjunctive query containment with respect to views and constraints
- Evaluating graph queries using semantic treewidth
- Semantic tree-width and path-width of conjunctive regular path queries
- Fine-grained complexity of ontology mediated queries (invited paper)
- An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries
- A more general theory of static approximations for conjunctive queries
- Rewriting queries using views in the presence of arithmetic comparisons
- Conjunctive query evaluation by search-tree revisited
- Weighted hypertree decompositions and optimal query plans
- A unified theory of structural tractability for constraint satisfaction problems
- On the power of structural decompositions of graph-based representations of constraint problems
This page was built for publication: Conjunctive query containment revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575132)
