N+1 problem

RU: N+1 проблема

A data-access anti-pattern where code executes one query to fetch a list of N items and then N additional queries — one per item — to fetch related data. Common in GraphQL when a field resolver fires a separate database call for each parent object; solved with batching (DataLoader) or eager loading.