Worst-case optimal join algorithms are attractive from a theoretical point of view, as they offer
asymptotically better runtime than binary joins on certain types of queries. In particular, they …

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 …

As database query processing techniques are being used to handle diverse workloads, a
key emerging challenge is how to efficiently handle multi-way join queries containing …

Abstract While factorization and Worst-Case Optimal Join (WCOJ) algorithms promise
significant performance improvements, their widespread adoption lacks behind because …

This thesis develops a comprehensive architectural blueprint for a high-performance flash-
based HTAP database system. In particular, we devise novel approaches for low-overhead …

The answer graph method is a query execution algorithm for graph databases that makes
smart use of factorization. It first constructs a factorized subgraph of the data graph …

The natural join is arguably the most studied operation in database theory and systems. In
2008, the way traditional join algorithms work was found to be suboptimal and a new tight …