count-min-log VS hyperloglog

Compare count-min-log vs hyperloglog and see what are their differences.

count-min-log

Go implementation of Count-Min-Log (by seiflotfy)

hyperloglog

HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom (by axiomhq)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
count-min-log hyperloglog
- 9
66 910
- 0.7%
0.0 3.3
about 7 years ago about 1 month ago
Go Go
MIT License MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

count-min-log

Posts with mentions or reviews of count-min-log. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning count-min-log yet.
Tracking mentions began in Dec 2020.

hyperloglog

Posts with mentions or reviews of hyperloglog. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2024-03-26.

What are some alternatives?

When comparing count-min-log and hyperloglog you can also consider the following projects:

ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]

golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.

binpacker - A binary stream packer and unpacker

cuckoofilter - Cuckoo Filter: Practically Better Than Bloom

skiplist - skiplist for golang

trie - Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.

boomfilters - Probabilistic data structures for processing continuous, unbounded streams.

bitset - Go package implementing bitsets

blooming-bella - A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.

roaring - Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog