Characterizing tractability of simple well-designed pattern trees with projection
type: Item
instance of: scholarly article
title: Characterizing tractability of simple well-designed pattern trees with projection
author: Stefan Mengel
author: Sebastian Skritek
published in: Theory of Computing Systems
publication date: 2021-06-24T00:00:00Z
Mathematics Subject Classification ID: 03Cxx
Mathematics Subject Classification ID: 68Pxx
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7363115
zbMATH Keywords: SPARQL
zbMATH Keywords: well-designed pattern trees
zbMATH Keywords: query evaluation
zbMATH Keywords: FPT
zbMATH Keywords: characterizing tractable classes
describes a project that uses: SPARQL
MaRDI profile type: Publication
Wikidata QID: Q112681728
full work available at URL: s00224-020-10002-z
OpenAlex ID: W3084963100
cites work: The tractability frontier of graph-like first-order query sets
cites work: Decomposing Quantified Conjunctive (or Disjunctive) Formulas
cites work: Block-Sorted Quantified Conjunctive Queries
cites work: Structural tractability of counting of solutions to conjunctive queries
cites work: Parametrized complexity theory.
cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side
cites work: When is the evaluation of conjunctive queries tractable?
cites work: Q5276183
cites work: Q5738936
cites work: On the Complexity of Enumerating the Answers to Well-designed Pattern Trees
cites work: Static analysis and optimization of semantic web queries
cites work: Tractable hypergraph properties for constraint satisfaction and conjunctive queries
cites work: Q5091134
cites work: On the complexity of database queries
DOI: 10.1007/S00224-020-10002-Z
description: scientific article; zbMATH DE number 7363115