Natural Joins by Prof. Yufei Tao

Abstract

This talk will focus on natural joins, a fundamental concept in database theory that generalizes the classical problem of subgraph enumeration in graph theory. A major breakthrough in the past decade has been the discovery of algorithms capable of computing any join in worst-case optimal time (with respect to data complexity). The talk will provide a self-contained introduction to the theoretical foundations underlying these algorithms.


Biography

Yufei Tao is a Professor in the Department of Computer Science and Engineering at The Chinese University of Hong Kong. His research focuses on designing small-and-sweet algorithms that are easy to deploy in practice (small) yet possess non-trivial theoretical guarantees (sweet). A Fellow of the ACM and the IEEE, he currently serves as the Editor-in-Chief of ACM Transactions on Database Systems (TODS).

Homepage: https://www.cse.cuhk.edu.hk/~taoyf