Avoiding Cross Products with the Query Graph

from blog NULL BITMAP by Justin Jaffray, | ↗ original
To compute the join of two relations, we find all pairs of rows their rows which have the same value for any columns with the same name. This is sometimes called the natural join in the software world, and in the join processing world is often just called the join. fn main() { let r = Relation::new(["a", "b"]) .row([1, 2]) ...