Skip to content

Commit 7533488

Browse files
committed
Provide additional comment on N+1 solutions.
1 parent bb8fa6f commit 7533488

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

src/pages/learn/performance.mdx

+1-1
Original file line numberDiff line numberDiff line change
@@ -89,7 +89,7 @@ query HeroWithFriends {
8989

9090
This is known as the N+1 problem, where the first request to an underlying data source leads to N subsequent requests to resolve the data for all of the requested fields.
9191

92-
This is commonly solved by a batching technique, where multiple requests for data from a backend are collected over a short period and then dispatched in a single request to an underlying database or microservice by using a tool like Facebook's [DataLoader](https://github.com/facebook/dataloader).
92+
This is commonly solved by a batching technique, where multiple requests for data from a backend are collected over a short period and then dispatched in a single request to an underlying database or microservice by using a tool like Facebook's [DataLoader](https://github.com/facebook/dataloader). Additionally, certain GraphQL implementations may have built-in capabilities that allow you to translate operation selection sets into optimized queries to underlying data sources.
9393

9494
## Demand control
9595

0 commit comments

Comments
 (0)