Dataloader 3.0: An Alternative Algorithm to Solve N+1 Problems - Jens Neuse, WunderGraph

Dataloader 3.0: An Alternative Algorithm to Solve N+1 Problems - Jens Neuse, WunderGraph
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.
GraphQL is a query language for APIs and a runtime for fulfilling those queries with your existing data. GraphQL provides a complete and understandable description of the data in your API, gives clients the power to ask for exactly what they need and nothing more, makes it easier to evolve APIs over time, and enables powerful developer tools. Get Started Here: graphql.org/

[@apidas]

very fun game. what a good speaker.
lee byron is sitting down. what is going on? lol I died

[@david-wundergraph]

Each question has a detailed README that explains why composition fails. Maybe we could open source the game. :)

[@AhmedElBanna]

Really wanna learn about the tests that you used to test if it will compose
any repo to share ?