# data structures

implementation notes on the structures themselves: their contracts, tradeoffs,
layout, and behavior on real hardware.

- [B+ trees](./b-plus-trees.md) — high-fanout ordered indexes, linked leaves, rebalancing, and bulk loading
- [bloom filters](./bloom-filters.md) — probabilistic membership, sizing, hashing, deletion, and locality
- [cache lifetimes](./cache-lifetimes.md) — bounding key populations and aligning derived state with owner lifetimes
- [ring buffers](./ring-buffers.md) — bounded queues and histories, wraparound, ownership, and concurrency
- [union–find](./union-find.md) — disjoint sets, weighted union, path compression, and dynamic limits