Prelegent: Jacek Ciszewski

Join processing is fundamental in the database domain. Authors of the paper “Leapfrog Triejoin: A Simple, Worst-Case Optimal Join Algorithm” present an interesting join algorithm that archives worst-case optimality for a family of problems. In this lecture I’ll describe how the algorithm works and show the proof of its complexity.