Writing

A 2026 reset: less hype, more depth-building in Go, creating lower-level systems projects, and writing to sharpen technical thinking.

The N+1 problem in GraphQL occurs when a query triggers an excessive number of database calls, with each relationship level multiplying the query count. Without optimization, a query fetching 25 categories with 25 products each generates 651 database calls. DataLoaders solve this by implementing three key mechanisms: batching combines individual lookups into single operations, coalescing merges requests in the same execution cycle, and caching prevents duplicate lookups within a request. The result? Just 3 database queries regardless of data size, dramatically improving API performance and scalability for nested queries with complex relationships