~/talk

Grafast: A Declarative Solution To GraphQL's Execution Woes

Talkat GraphQLConf 2026 · on Wednesday, 2026-05-20· at 13:55· Boardroom· [graphql]
slides:none on file

Grafast replaces depth-first per-field resolvers with declarative planning that builds a request-wide execution plan, then executes breadth-first to batch and deduplicate I/O. It provides synchronous plan-resolvers and built-in steps like load many/load one to express batched DB and API calls, drops SQL queries and DB CPU, and shows ~5x throughput with average latency under 100 ms in the presented benchmark while remaining compatible via a resolver-emulation layer.

AI-written summary · about

  1. 0:00Introduction to GraphQL issues
  2. 3:32Introducing Grafast solution
  3. 11:18Grafast execution model
  4. 13:02Plan resolvers in Grafast
  5. 19:02Benchmarking Grafast benefits
  6. 22:34Why efficiency matters now
  7. 23:16Q&A and resources
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.