Utilizing parallelism in the two-phase approach of translated fsUDFs
We translate fsUDFs, UDF with recursive calls, into SQL. The way the UDF then evaluates does not rely on recursive calls anymore. Instead, we first determine the call graph of the fsUDF top-down and then evaluate it bottom-up with the help of (standard SQL) recursive queries.
This two-phased approach hides potential for parallelism which we want to explore in this work.