On the Complexity of Enumerating the Answers to Well-designed Pattern Trees

DOI10.4230/LIPIcs.ICDT.2016.22zbMath1369.68191OpenAlexW2346099666MaRDI QIDQ5276203

Markus Kröll, Sebastian Skritek, Reinhard Pichler

Publication date: 14 July 2017

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.ICDT.2016.22

zbMATH Keywords

complexityenumerationSPARQLCQspattern trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Data structures (68P05)

Related Items (4)

Generating clause sequences of a CNF formula ⋮ A complexity theory for hard enumeration problems ⋮ Unnamed Item ⋮ Characterizing tractability of simple well-designed pattern trees with projection

This page was built for publication: On the Complexity of Enumerating the Answers to Well-designed Pattern Trees