Episode 21 - Maps, Hash Maps, Tree Maps, and ...

The episode is inspired by research I conducted a few years ago in which I interviewed hundreds of other senior engineers and architects building web applications at scale.I begin by introducing the concept of micro frontends and discussing when to use them versus relying on more ...  Show more

In this episode, we'll cover what AI agents are, how they work, common agentic implementation patterns, and how agents manage their context window. Enjoy! 

Hash tables are effective for caching, database joins, sets to check if something is in a list and even load balancing, partitioning and sharding and many other applications. Most programming languages support hash tables. However they don’t come without their cost and limitation ...  Show more

In this episode of the backend engineering show I discuss consistent hashing a very important algorithm in distributed computing specially in database systems such as Apache Cassandra and DynamoDB. 0:00 Intro 2:00 Problem of Distributed Systems 5:00 When to Distribute 7:00 Simple ...  Show more

Jump in on a second episode of the Better Science series with guest host and Technical Evangelist Justin Emerson interviewing FlashArray engineer Feng Wang about how Pure maps data at scale with a single, scalable data structure. Managing storage in modern times requires a strate ...  Show more

In this episode of the backend engineering show I'll discuss the difference between b-tree and b+tree why they were invented, what problems do they solve, and the advantages and disadvantages of both. I'll also discuss the limitation of implementing b-tree over b+t ...