scientific article; zbMATH DE number 7561480

DOI10.4230/LIPIcs.ICDT.2019.20MaRDI QIDQ5091134

Sebastian Skritek, Stefan Mengel

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

query evaluationSPARQLFPTcharacterizing tractable classeswell-designed pattern trees

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

Characterizing tractability of simple well-designed pattern trees with projection

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of weighted counting for acyclic conjunctive queries
• On the complexity of database queries
• Parametrized complexity theory.
• Tractable hypergraph properties for constraint satisfaction and conjunctive queries
• Static analysis and optimization of semantic web queries
• Decomposing Quantified Conjunctive (or Disjunctive) Formulas
• The complexity of homomorphism and constraint satisfaction problems seen from the other side
• The tractability frontier of graph-like first-order query sets
• When is the evaluation of conjunctive queries tractable?
• On the Complexity of Enumerating the Answers to Well-designed Pattern Trees
• Block-Sorted Quantified Conjunctive Queries