Defining depth and sorting while preloading a (single-schema hierarchical) join

[BrightEyesDavid]

Thanks very much, both. I’ve now switched to using Arbor as I did end up needing to fully load the trees.

@garrison

Once you have the rows you are going to have to manually stitch them back into a tree. I am going from memory here but I think the simplest algorithm I came up with for this was to use Enum.group_by on the rows to group them by parent_id and then use a recursive function to place the children into a children field on each parent, recursively, until the tree is built.

I went with this. Thanks for the useful additional information.