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

The first edition of this book appeared in 1991 when the technology was new and there were
not too many products. In the Preface to the first edition, we had quoted Michael Stonebraker …

Modern computing tasks such as real-time analytics require refresh of query results under
high update rates. Incremental View Maintenance (IVM) approaches this problem by …

We study the enumeration complexity of Unions of Conjunctive Queries (UCQs). We aim to
identify the UCQs that are tractable in the sense that the answer tuples can be enumerated …

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 introduce F-IVM, a unified incremental view maintenance (IVM) approach for a variety of
tasks, including gradient computation for learning linear regression models over joins, matrix …

We study the question of when we can provide direct access to the k-th answer to a
Conjunctive Query (CQ) according to a specified order over the answers in time logarithmic …

Popular fine-grained hypotheses have been successful in proving conditional lower bounds
for many dynamic problems. Two of the most widely applicable hypotheses in this context …

Strong (resp. weak) average-case hardness refers to the properties of a computational
problem in which a large (resp. small) fraction of instances are hard to solve. We develop a …