Export
The link always opens the latest version of this page.
Ask an AI about it
Open in ChatGPTA new chat that reads this entry from the site Open in ClaudeThe same, in ClaudeShare the link instead of a file, and they will always see the latest version.
Files are a snapshot of today. The live page has anything newer.
nalgeon/unsure
Go package implementing Bloom filters, count-min sketches, HyperLogLog, T-digest and top-k sketches with 100–300 LOC per structure, 2–4× faster than competitors, drastically lower memory usage
- Category
- probabilistic data structures library 1 source
Go package implementing Bloom filters, count-min sketches, HyperLogLog, T-digest and top-k sketches with 100–300 LOC per structure, 2–4× faster than competitors, drastically lower memory usage.
Drawn from 1 news source; the facts and relationships below show where each detail comes from.
Facts 1
| Attribute | Value | Confidence | Sources | Cited |
|---|---|---|---|---|
| Category | probabilistic data structures library | low | 1 | 1 |
Sources 1
- Probabilistic data structures in Go · Lobsters