Constant delay enumeration for conjunctive queries Page 1 Constant Delay Enumeration for
Conjunctive Queries — a Tutorial Christoph Berkholz Fabian Gerhardt Nicole Schweikardt …

We consider the task of enumerating and counting answers to k-ary conjunctive queries
against relational databases that may be updated by inserting or deleting tuples. We exhibit …

We consider the information extraction framework known as document spanners and study
the problem of efficiently computing the results of the extraction from an input document …

We investigate trade-offs in static and dynamic evaluation of hierarchical queries with
arbitrary free variables. In the static setting, the trade-off is between the time to partially …

We investigate the enumeration of top-k answers for conjunctive queries against relational
databases according to a given ranking function. The task is to design data structures and …

Disjoint-paths logic, denoted FO+ DP, extends first-order logic (FO) with atomic predicates
dp k [(x 1, y 1),…,(xk, yk)], expressing the existence of internally vertex-disjoint paths …

We consider the evaluation of first-order queries over classes of databases that are nowhere
dense. The notion of nowhere dense classes was introduced by Nesetril and Ossona de …

We give an algorithm to enumerate the results on trees of monadic second-order (MSO)
queries represented by nondeterministic tree automata. After linear time preprocessing (in …

First-Order Logic with Counting At Least, Weak Hanf Normal Forms Always Exist and Can Be
Computed! Page 1 First-Order Logic with Counting At Least, Weak Hanf Normal Forms Always …

We investigate the enumeration of query results for an important subset of CQs with
projections, namely star and path queries. The task is to design data structures and …