Probabilistic data structures for processing continuous, unbounded streams.
An implementation of Count-Min Sketch in Golang
go patterns
High performance approximate algorithms in Go (e.g. morris counter, count min, etc.)
an implementation of Count-Min Sketch, an approximate counting data structure for summarizing data streams, in golang
Thread-safe and persistent Golang implementations of probabilistic data structures: Bloom Filter, Cuckoo Filter, HyperLogLog, Count-Min Sketch and Top-K
CountMin sketching algorithm in golang
Repository for an article series on probabilistic data structures including Skiplist, bloom filter, counting bloom filter, count sketch, count min sketch etc
Count-Min Sketch
An implementation of W-TinyLFU policy
Key-value storage engine in Go with caching, compaction and probabilistic data structures.
Probabilistic data structures implemented in Go.
A set of probabilistic data structures
Repo for measuring (Internet) traces. Evaluate micro-batching in data stream processing and the impact of a batch loss on Count-Min Sketch estimation error.
Add a description, image, and links to the count-min-sketch topic page so that developers can more easily learn about it.
To associate your repository with the count-min-sketch topic, visit your repo's landing page and select "manage topics."