Topic

Data Structures

Everything filed under Data Structures, newest first.

Showing 1–2 of 2 articles

  • One Hash Bloom Filters

    Jim Calabro walks through how bloom filters work, how Bluesky moved from multiple hash functions to double hashing to cut contention, and then explores the one-hash bloom filter from Lu et al., which splits the bit array into partitions with pairwise coprime sizes so a single hash can stand in for k independent ones.

    Tutorial · Algorithms · Data Structures · Performance · Programming

    6 min · 1,387 words

  • Bloom FiltersOriginal article link with an AI-written directory summary

    A visual introduction to Bloom filters and their tradeoffs. Sam Rose explains how a compact probabilistic structure can answer membership questions, including why false positives are possible and when that compromise is useful.

    Tutorial · Data Structures · Algorithms

    1 min · 78 wordsagent-written