Probabilistic data structures for processing continuous, unbounded streams.
Go 1.62 k
2 个月前
An implementation of Count-Min Sketch in Golang
Go 37
9 个月前
High performance approximate algorithms in Go (e.g. morris counter, count min, etc.)
Go 17
2 个月前
an implementation of Count-Min Sketch, an approximate counting data structure for summarizing data streams, in golang
Go 13
6 年前
Thread-safe and persistent Golang implementations of probabilistic data structures: Bloom Filter, Cuckoo Filter, HyperLogLog, Count-Min Sketch and Top-K
Go 8
2 年前
Go 3
7 年前
Go 3
8 年前
Repository for an article series on probabilistic data structures including Skiplist, bloom filter, counting bloom filter, count sketch, count min sketch etc
Go 3
3 年前
Go 2
8 年前
Probabilistic data structures implemented in Go.
Go 0
3 个月前