Part 6
2 chapters
Data Fetching at Scale
Paginate large lists with connections and eliminate N+1 fetches with batching and dataloaders.
Chapter 12
Connections and pagination
How a growing list becomes a Relay connection: offset against keyset pagination, edges, nodes and PageInfo, opaque versioned cursors, forward and backward paging, stability under inserts, filters and totalCount, bad arguments as BAD_USER_INPUT, one failing node nulling one edge, and the source calls a page costs.
Chapter 13
The N+1 problem and DataLoaders
Counting the source calls a four-cargo page costs, batching them one call per owner, the DataLoader contract and its tick, SmallRye @Source List batch resolvers against Strawberry DataLoaders, per-field against per-key loaders, bulk source operations, and what one failing key does to its batch.