Tractable counting of the answers to conjunctive queries
From MaRDI portal
Publication:389242
DOI10.1016/j.jcss.2013.01.012zbMath1408.68051OpenAlexW2077814962MaRDI QIDQ389242
Sebastian Skritek, Reinhard Pichler
Publication date: 20 January 2014
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2013.01.012
Related Items (6)
Structural tractability of counting of solutions to conjunctive queries ⋮ Tractable counting of the answers to conjunctive queries ⋮ The complexity of weighted counting for acyclic conjunctive queries ⋮ Answer Counting under Guarded TGDs ⋮ Linear Programs with Conjunctive Database Queries ⋮ Counting Answers to Existential Questions
Cites Work
- Unnamed Item
- Unnamed Item
- Tractable counting of the answers to conjunctive queries
- Hypertree decompositions and tractable queries
- The complexity of counting homomorphisms seen from the other side
- On counting and approximation
- Conjunctive query containment revisited
- A comparison of structural CSP decomposition methods
- Conjunctive-query containment and constraint satisfaction
- Complexity of generalized satisfiability counting problems
- Subtractive reductions and complete problems for counting complexity classes
- Tractable hypergraph properties for constraint satisfaction and conjunctive queries
- Degrees of acyclicity for hypergraphs and relational database schemes
- The complexity of acyclic conjunctive queries
- Query evaluation via tree-decompositions
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- Quantitative Relativizations of Complexity Classes
- Graph minors. II. Algorithmic aspects of tree-width
- The Complexity of Enumeration and Reliability Problems
- The Parameterized Complexity of Counting Problems
- Theory and Applications of Satisfiability Testing
This page was built for publication: Tractable counting of the answers to conjunctive queries
