Lambda World 2018 - The Radix Trees How IntMap Works - Tikhon Jelvis

Tikhon Jelvis explains the mechanics of Radix Trees and how Haskell implements them under the hood for the IntMap data structure.

This presentation by Tikhon Jelvis took place at Lambda World Seattle on September 18th, 2018 at the Living Computers Museum in Washington. The Radix Tree: How IntMap Works The Radix Tree (aka PATRICIA Trie) is an efficient data structure for key-value maps with integral keys. Radix tries come up in a wide range of applications like in-memory databases and the Linux kernel, and can be turned into a persistent data structure useful for functional code (Haskell's IntMap). With pictures and code, I'll walk you through how the data structure works, what Haskell's implementation looks like under the hood and several ways it's useful in functional code. I'll finish with a look towards the future: a quick overview of the Adaptive Radix Tree, a recently published variation on normal Radix Trees with real potential. While this talk will be Haskell flavored, the data structure itself and the general concepts are all language-agnostic. Follow: -twitter.com/lambda_world -twitter.com/47deg -twitter.com/tikhonjelvis Visit: -47deg.com/events for more details -lambda.world