An implementation of Count-Min Sketch in Golang
-
Updated
May 19, 2016 - Go
An implementation of Count-Min Sketch in Golang
Count-Min Sketch
CountMin sketching algorithm in golang
an implementation of Count-Min Sketch, an approximate counting data structure for summarizing data streams, in golang
go patterns
Probabilistic data structures for processing continuous, unbounded streams.
Repository for an article series on probabilistic data structures including Skiplist, bloom filter, counting bloom filter, count sketch, count min sketch etc
Thread-safe and persistent Golang implementations of probabilistic data structures: Bloom Filter, Cuckoo Filter, HyperLogLog, Count-Min Sketch and Top-K
High performance approximate algorithms in Go (e.g. morris counter, count min, etc.)
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."