News for hackers. Stuff that matters.
Re:The surprisingly difficult problem of user-defined order ... by spiffytech on Friday January 15, 2021 @09:49PM (#25799534)
Fortunately modern SQL dialects that support recursive CTEs make the syntax for doing this in a single query approachable . I haven't found good data on how performant recursive CTEs are at scale, but it's surely better than doing the loop with round trips to the database inside your application code.
Re:The surprisingly difficult problem of user-defined order ... by barrkel on Friday January 15, 2021 @10:52PM (#25799871)
Recursive CTEs are an excellent way to write a very slow query.

You save the cost of network round trips, parsing the query, optimizing the join order etc., but your recursive CTE is otherwise executed once per iteration. For trees, that's typically the depth; for linked lists, it'll be the length of the list. In practice they both suck, and will be trivially outperformed by almost any other technique.

Re:The surprisingly difficult problem of user-defined order ... by andreareina on Saturday January 16, 2021 @01:29AM (#25800533)
A linked list is a degenerate tree, after all