Query evaluation via tree-decompositions
From MaRDI portal
Recommendations
Cited in
(57)- Conjunctive query containment over trees using schema information
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- Static analysis and query answering for incomplete data trees with constraints
- Tree pattern query minimization
- An existential locality theorem
- Computing crossing numbers in quadratic time
- Constraint satisfaction with succinctly specified relations
- Compact representation for answer sets of n-ary regular queries
- Some aspects of the database resilience
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Evaluating Datalog via tree automata and cycluits
- Answering conjunctive queries with inequalities
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
- Structural tractability of counting of solutions to conjunctive queries
- Tree-width for first order formulae
- Flexible Querying Using Criterion Trees: A Bipolar Approach
- scientific article; zbMATH DE number 2086293 (Why is no real title available?)
- Marshals, monotone marshals, and hypertree-width
- Semantic acyclicity on graph databases
- Connecting width and structure in knowledge compilation
- Provenance circuits for trees and treelike instances
- Obtaining a Planar Graph by Vertex Deletion
- Interpreting Tree-to-Tree Queries
- Compact Representation for Answer Sets of n-ary Regular Queries
- The monadic second-order logic evaluation problem on finite colored trees: a database-theoretic approach
- Tree-Width for First Order Formulae
- Hyperconsistency width for constraint satisfaction: Algorithms and complexity results
- Tractable counting of the answers to conjunctive queries
- The complexity of weighted counting for acyclic conjunctive queries
- Courcelle's theorem -- a game-theoretic approach
- scientific article; zbMATH DE number 2080462 (Why is no real title available?)
- Recognizable languages of arrows and cospans
- SOME MODEL THEORY OF GUARDED NEGATION
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- On supergraphs satisfying CMSO properties
- Optimizing tree decompositions in MSO
- Computing Tree Decompositions
- An Experimental Study of the Treewidth of Real-World Graph Data
- A Practical Approach to Courcelle's Theorem
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- On the complexity of existential positive queries
- Uniform Constraint Satisfaction Problems and Database Theory
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas
- First-Order Model-Checking in Random Graphs and Complex Networks
- Guarded negation
- scientific article; zbMATH DE number 7779293 (Why is no real title available?)
- Parameterised counting in logspace
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments
- Learning concepts definable in first-order logic with counting
- Parameterised counting in logspace
- Enumeration of minimal hitting sets parameterized by treewidth
- Optimal oblivious algorithms for multi-way joins
- Enumeration complexity of conjunctive queries with functional dependencies
- On the expressive power of monadic least fixed point logic
- Conjunctive query evaluation by search-tree revisited
- Weighted hypertree decompositions and optimal query plans
- Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs
This page was built for publication: Query evaluation via tree-decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455547)
