Parallelize all the things -- Deconstructing Haxl, with Clojure macros, topological sorting and Quasar fibers
Recently, there's been a lot of interest in DSLs to address the so-called N+1 selects problem, which describes the very common situation where you
- Do one database query to get a list of things, say user IDs;
- for each, call some sort of processing function that happens to
- do another query, say for each user's name.
It can be even worse than that, as in this example, where (for some reason) we want to append the last name of every person in a group to the first name of their best friend. (Maybe they're getting married.)