Sketches

• Bloom Filters and Probabilistic Data Structures: Trading Certainty for Speed · 2024-08-22

  Explore how Bloom filters, Count-Min sketches, and HyperLogLog sacrifice perfect accuracy for dramatic space and time savings—and learn when that trade-off makes sense.

• Streaming Algorithms: Misra-Gries, Count-Min Sketch, AMS, and the Power of Small Space · 2019-06-27

  A comprehensive tour of streaming algorithms—from frequency estimation sketches to frequency moments—and the space lower bounds that define what's possible.