When you ask GraphQL Developers how they solve N+1 problems, the immediate answer you get is using the "Dataloader" pattern.
What actually is the Dataloader pattern? How does it work and how does it solve the problem?
This talk dives deep into the topic of efficiently resolving deeply nested data.
Once we understand how the Dataloader pattern works,
we explore its drawbacks and limitations.
Finally, we will present an alternative algorithm that uses breadth-first resolving compared to depth-first, which Dataloader builds on top.
Join Jens in this talk to learn more about how breadth-first resolving could help GraphQL servers and Gateways resolve N+1 problems more effectively.