Join ordering and join processing has a huge impact on query execution and can easily
affect the query response time by orders of magnitude. In particular, when joins are …

We study the dynamic query evaluation problem: Given a join query Q and a stream of
updates, we would like to construct a data structure that supports constant-delay …

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 …

The problem of continual observation under differential privacy has been studied extensively
in the literature. However, all existing works, with the exception of [28, 51], have only studied …

Sampling over joins is a fundamental task in large-scale data analytics. Instead of computing
the full join results, which could be massive, a uniform sample of the join results would …

A common challenge for database management systems (DBMSs) is efficiently evaluating
queries. The most basic queries are conjunctive queries (CQs), which are SELECT-FROM …

Database queries can produce a huge output that is infeasible to compute, regardless of the
algorithm or system that processes them. This can often occur when the query joins large …

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 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 …

Continuous subgraph matching (CSM) is an operation that keeps processing subgraph
queries on a dynamic data graph. This operation is essential to many applications, but it is …