Morning Fold
en

unsure

  1. Go

    Probabilistic data structures in Go, part 2

    Covers binary fuse filters, UltraLogLog, log-linear histograms and MinHash with the unsure package, comparing each with Bloom filters and HyperLogLog.

  2. Go

    Probabilistic data structures in Go, part 2

    Covers binary fuse filters, UltraLogLog, log-linear histograms and MinHash with the unsure Go package. It compares their memory use and error guarantees with Bloom filters.

  3. Go

    Probabilistic data structures in Go

    Explains Bloom filters, count-min sketches, HyperLogLog, t-digest and top-k, and their memory-accuracy trade-offs. Introduces the dependency-free unsure Go package, where a 1% Bloom filter is about 50 times smaller than a set.

  4. Go

    Probabilistic data structures in Go

    Explains Bloom filters, count-min sketches, HyperLogLog, t-digest and top-k, and their memory-accuracy trade-offs. Introduces the dependency-free unsure Go package, where a 1% Bloom filter is about 50 times smaller than a set.

Add Morning Fold to your home screen

  1. Tap the Share button <svg viewBox="0 0 24 24" aria-hidden="true"><path d="M12 15V4M7.5 8.5 12 4l4.5 4.5M5 13v5.5A1.5 1.5 0 0 0 6.5 20h11a1.5 1.5 0 0 0 1.5-1.5V13"/></svg> at the bottom of Safari.
  2. Scroll down and tap Add to Home Screen.
  3. Tap Add. Morning Fold opens from its icon, full screen.

Create a free account

Morning Fold is free. Already have an account? Log in