Not all Graphs are Trees

from blog NULL BITMAP by Justin Jaffray, | ↗ original
It's pretty easy to imagine how to represent relational algebra expressions as a tree—they are already structurally rooted trees where each operator has its inputs as children. Even in a language like Rust, which has not yet implemented mutable aliasing (an oft-requested feature stuck at the RFC stage) we can implement this easily: enum RelExpr...