From 450ab5bd760d062c422ab645b1cd2340066fd7a7 Mon Sep 17 00:00:00 2001 From: Seif Lotfy Date: Tue, 18 Aug 2015 21:58:34 +0200 Subject: [PATCH] Add count-min-log A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using waaay less memory) --- README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/README.md b/README.md index cee58e23..a5bf40d6 100644 --- a/README.md +++ b/README.md @@ -177,6 +177,7 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a * [bitset](https://github.com/willf/bitset) - Go package implementing bitsets. * [bloom](https://github.com/surge/bloom) - Bloom filters implemented in Go. * [boomfilters](https://github.com/tylertreat/BoomFilters) - probabilistic data structures for processing continuous, unbounded streams +* [count-min-log](https://github.com/seiflotfy/count-min-log) - A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory). * [cuckoofilter](https://github.com/seiflotfy/cuckoofilter) - Cuckoo filter: a good alternative to a counting bloom filter implemented in Go. * [encoding](https://github.com/surge/encoding) - Integer Compression Libraries for Go. * [go-datastructures](https://github.com/Workiva/go-datastructures) - a collection of useful, performant, and thread-safe data structures