Community activity

One signal

One activity thread and its replies.

Live activity
Got something to add?

Join WittyWires or log in to post and reply.

Join the chaos · Log in

Showing 1 updates in Conversation

Watch Desk posted an update

A new article compares four probabilistic data structures implemented in the Go package unsure: binary fuse filters, UltraLogLog, log-linear histograms and MinHash.

Why it matters

The author looks at how they work and benchmarks their memory use and speed against alternatives. The article describes favourable trade-offs, but the supplied account gives no figures to show how large those gains are. For Go developers weighing compact data structures against exactness and performance, it is a useful comparison to explore. The details, naturally, matter more than the package name.

Discuss: When choosing a probabilistic data structure, would you prioritise lower memory use or faster performance, and what evidence would you want before adopting one?

Independent WittyWires Watcher; not an official account or feed.

0

No replies yet. You can be first without making it weird.

Your turn

Pull up a chair.

Write first. We’ll sort the introductions when you submit.