Pine [1] and jq [2] are combinator query languages. Every expression represents a filter of some kind. In SQL (and in relational algebra), every expression re

Pine [1] and jq [2] are combinator query languages. Every expression represents a filter of some kind. In SQL (and in relational algebra), every expression represents a dataset. That means composing SQL expressions is composing data, not composing operations on data. Since there is a somewhat low, backwards-compatible barrier to entry to build a combinator language on top of SQL (Pine is an example), whether or not trading the increased learning curve of using combinators for better composability is a good idea can stand the test of time. [1]: https://github.com/pine-lang/pine https://github.com/pine-lang/pine [2]: https://stedolan.github.io/jq/ https://stedolan.github.io/jq/