> On Jun 14, 2015, at 4:01 PM, david at andl.org wrote: > > First, I added a RECURSE() function to Andl, similar to the CTE in SQLite.
Nice. > The Mandelbrot algorithm looks like this. Could we see something more, hmmm, pedestrian? Perhaps a simple recursive query, showing, say, all the managers of an employee given the following structure: create table employee( id integer not null, manager_id integer, constraint employee_pk primary key( id ), constraint employee_manager_fk foreign key( manager_id ) references employee( id ) )
