This work reviews how database theory uses tractable circuit classes from knowledge
compilation. We present relevant query evaluation tasks, and notions of tractable circuits …

We pose the fine-grained hardness hypothesis that the textbook algorithm for the NFA
Acceptance problem is optimal up to subpolynomial factors, even for dense NFAs and fixed …

In this paper, we investigate space-time tradeoffs for answering conjunctive queries with
access patterns (CQAPs). The goal is to create a space-efficient data structure in an initial …

We study the dynamic query evaluation problem: Given a full conjunctive query Q and a
sequence of updates to the input database, we construct a data structure that supports …

We investigate the evaluation of conjunctive queries over static and dynamic relations. While
static relations are given as input and do not change, dynamic relations are subject to inserts …

We overview recent progress on the longstanding problem of incremental view maintenance
(IVM), with a focus on the fine-grained complexity and optimality of IVM for classes of …

Factorized Databases (FDBs) and the recently introduced Path Multiset Representations
(PMRs) both aim at compactly representing results of database queries, and are quite …

We study the classical evaluation problem for regular path queries: Given an edge-labeled
graph and a regular path query, compute the set of pairs of vertices that are connected by …

We study the dynamic query evaluation problem: Given a full conjunctive query Q and a
sequence of updates to the input database, we construct a data structure that supports …