Madelyn Olson discusses the evolution of Valkey’s data structures, moving away from “textbook” pointer-chasing HashMaps to more cache-aware designs. She explains the implementation of “Swedish” tables to maximize memory density. She shares insights on systems intuition, memory prefetching, and the rigorous testing needed for mission-critical caches. By Madelyn Olson