zlacker

>>legran+(OP)
The pipeline syntax as presented is nicer than the status quo, but I'd prefer a syntax that models query execution as a directed graph of operations. Doing so would not only make some of the more complex SQL query constructs much more straightforward to represent:

* Joins can be modelled as a "cross-referencing" operation that consume two (or more) data streams and produce a single data stream

* CTEs can be modelled as producing multiple data streams

* Recursive CTEs can be modelled as cycles in the execution graph

>>10000t+Ch
> a directed graph of operations

What syntax do you know that can represent a dag in text?

>>almost+Gp
Any syntax with a let operator to name stuff or a lambda abstraction.

>>cha42+iC
That only gives you trees not DAGs - you can't do fan-in (there's no way to "share" let bound names).