A proof of the AGM bound
In this talk we will give a self-contained proof of the AGM bound, which establishes a bound on the size of the result of a natural join. The proof is the key to obtaining optimal algorithms for join evaluation.
In this talk we will give a self-contained proof of the AGM bound, which establishes a bound on the size of the result of a natural join. The proof is the key to obtaining optimal algorithms for join evaluation.