count-min-sketch
Here are 10 public repositories matching this topic...
Repository for an article series on probabilistic data structures including Skiplist, bloom filter, counting bloom filter, count sketch, count min sketch etc
-
Updated
Feb 24, 2023 - Go
CountMin sketching algorithm in golang
-
Updated
Jul 26, 2018 - Go
Count-Min Sketch
-
Updated
Aug 25, 2017 - Go
Thread-safe and persistent Golang implementations of probabilistic data structures: Bloom Filter, Cuckoo Filter, HyperLogLog, Count-Min Sketch and Top-K
-
Updated
Jan 21, 2024 - Go
High performance approximate algorithms in Go (e.g. morris counter, count min, etc.)
-
Updated
Feb 27, 2024 - Go
an implementation of Count-Min Sketch, an approximate counting data structure for summarizing data streams, in golang
-
Updated
Dec 30, 2019 - Go
An implementation of Count-Min Sketch in Golang
-
Updated
May 19, 2016 - Go
go patterns
-
Updated
Dec 3, 2020 - Go
Probabilistic data structures for processing continuous, unbounded streams.
-
Updated
Mar 15, 2021 - Go
Improve this page
Add a description, image, and links to the count-min-sketch topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the count-min-sketch topic, visit your repo's landing page and select "manage topics."