about things notes.zzstoatzz.io
README.md

data structures #

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

  • B+ trees — high-fanout ordered indexes, linked leaves, rebalancing, and bulk loading
  • bloom filters — probabilistic membership, sizing, hashing, deletion, and locality
  • compact point-read indexes — dependent reads, value layout, miss costs, SQLite payload overflow, and request allocation
  • page caches — clock eviction, a direct page→frame table, and a read-only mapping in place of frames
  • ring buffers — bounded queues and histories, wraparound, ownership, and concurrency
  • union–find — disjoint sets, weighted union, path compression, and dynamic limits