DeepAI AI Chat
Log In Sign Up

Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width

by   Christoph Berkholz, et al.
Humboldt-Universität zu Berlin

Marx (STOC 2010, J. ACM 2013) introduced the notion of submodular width of a conjunctive query (CQ) and showed that for any class Φ of Boolean CQs of bounded submodular width, the model-checking problem for Φ on the class of all finite structures is fixed-parameter tractable (FPT). Note that for non-Boolean queries, the size of the query result may be far too large to be computed entirely within FPT time. We investigate the free-connex variant of submodular width and generalise Marx's result to non-Boolean queries as follows: For every class Φ of CQs of bounded free-connex submodular width, within FPT-preprocessing time we can build a data structure that allows to enumerate, without repetition and with constant delay, all tuples of the query result. Our proof builds upon Marx's splitting routine to decompose the query result into a union of results; but we have to tackle the additional technical difficulty to ensure that these can be enumerated efficiently.


page 1

page 2

page 3

page 4


Hypertree Decompositions and Tractable Queries

Several important decision problems on conjunctive queries (CQs) are NP-...

Twin-Width is Linear in the Poset Width

Twin-width is a new parameter informally measuring how diverse are the n...

Boolean Tensor Decomposition for Conjunctive Queries with Negation

We propose an algorithm for answering conjunctive queries with negation,...

On Functional Aggregate Queries with Additive Inequalities

Motivated by fundamental applications in databases and relational machin...

Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems

Answering Conjunctive Queries (CQs) and solving Constraint Satisfaction ...

The Complexity of Boolean Conjunctive Queries with Intersection Joins

Intersection joins over interval data are relevant in spatial and tempor...

Constant-delay enumeration for SLP-compressed documents

We study the problem of enumerating results from a query over a compress...