News for hackers. Stuff that matters.
Re:Understanding N + 1 queries problem by taffer on Tuesday January 03, 2023 @04:58AM (#34229730)
The problem lies in the word navigate. The code in the article navigates through a graph. There is simply no way to navigate graphs in an eagerly evaluated language without running into the N+1 problem. A declarative language that can be lazily evaluated by the DBMS is the only way to efficiently query a graph.

There are no comments on this comment yet.