Netflix's serving layer for its Real-Time Distributed Graph, built to answer tens of thousands of queries/sec in under 100ms. Jordan and Riley dig into the two query shapes (shallow-wide vs. deep-narrow), why they chose breadth-first batched traversal over depth-first, the async-first threading model over thread-per-request, and packing multi-hop traversals into a single gRPC call to kill per-hop round-trips.

Source: How and Why Netflix Built a Real-Time Distributed Graph, Part 3: Querying the Graph with gRPC — Netflix Tech Blog, Aug 7 2026 — https://netflixtechblog.com/how-and-why-netflix-built-a-real-time-distributed-graph-part-3-querying-the-graph-wit ...