Cute lil digger on a under construction sign

New site, mind the dust! Please log any issues or suggestions


March 29th, 2021 × #GraphQL#databases#performance

Hasty Treat - What is the n+1 problem?

Wes and Scott discuss the n+1 database query problem, explaining what it is and solutions like batching IDs, DataLoader, and Prisma.


In this Hasty Treat, Scott and Wes talk about a common problem you'll encounter in your development career — the n+1 problem.

Hasura - Sponsor

With Hasura, you can get a fully managed, production-ready GraphQL API as a service to help you build modern apps faster. You can get started for free in 30 seconds, or if you want to try out the Standard tier for zero cost, use the code “TryHasura” at this link: We’ve also got an amazing selection of GraphQL tutorials at

Sentry - Sponsor

If you want to know what’s happening with your code, track errors and monitor performance with Sentry. Sentry’s Application Monitoring platform helps developers see performance issues, fix errors faster, and optimize their code health. Cut your time on error resolution from hours to minutes. It works with any language and integrates with dozens of other services. Syntax listeners new to Sentry can get two months for free by visiting and using the coupon code TASTYTREAT during sign up.

Show Notes

05:00 - What is the n+1 problem?

  • The N+1 problem can happen in any language but is especially prevalent in GraphQL because it's so easy to query relationships.

09:33 - The solution

  • The solution to the n+1 problem is to batch the queries. As you loop over each podcast, keep an array of host IDs to lookup. Once you have looped over the podcasts, make a single query to the database with your large array of podcast host Ids.

11:11 - Should you care?

Tweet us your tasty treats!