Florent Capelli

A Simple Algorithm for Worst Case Optimal Join and Sampling

2024 · arXiv (Cornell University)

We present an elementary branch and bound algorithm with a simple analysis of why it achieves worstcase optimality for join queries on classes of databases defined respectively by cardinality or acyclic degree constraints. We then …