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

Efficient join processing is one of the most fundamental and well-studied tasks in database
research. In this work, we examine algorithms for natural join queries over many relations …

Cardinality estimation is one of the most fundamental and challenging problems in query
optimization. Neither classical nor learning-based methods yield satisfactory performance …

We present an indexing scheme that supports worst-case optimal (wco) joins over graphs
within compact space. Supporting all possible wco joins using conventional data structures …

Despite the crucial role of cardinality estimation in query optimization, there has been no
systematic and in-depth study of the existing cardinality estimation techniques for subgraph …

Recent works on bounding the output size of a conjunctive query with functional
dependencies and degree bounds have shown a deep connection between fundamental …

Subgraph counting, as a fundamental problem in network analysis, is to count the number of
subgraphs in a data graph that match a given query graph by either homomorphism or …

Worst-case optimal join algorithms are the class of join algorithms whose runtime match the
worst-case output size of a given join query. While the first provably worse-case optimal join …

Over the last decade, worst-case optimal join (WCOJ) algorithms have emerged as a new
paradigm for one of the most fundamental challenges in query processing: computing joins …

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 …