| RedisBloom/RedisBloom |
1,546 |
|
0 |
0 |
about 2 years ago |
0 |
|
47 |
other |
C |
| Probabilistic Datatypes Module for Redis |
| alecmocatta/streaming_algorithms |
59 |
|
1 |
2 |
over 3 years ago |
5 |
July 15, 2020 |
4 |
apache-2.0 |
Rust |
| Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling. |
| RedisLabsModules/countminsketch |
38 |
|
0 |
0 |
over 6 years ago |
0 |
|
2 |
agpl-3.0 |
C |
| An apporximate frequency counter Redis module |
| isarn/isarn-sketches-spark |
27 |
|
0 |
0 |
over 3 years ago |
19 |
June 20, 2020 |
6 |
apache-2.0 |
Scala |
| Routines and data structures for using isarn-sketches idiomatically in Apache Spark |
| barrust/count-min-sketch |
25 |
|
0 |
0 |
over 4 years ago |
0 |
|
1 |
mit |
C |
| Count-Min Sketch Implementation in C |
| mikolalysenko/count-min-sketch |
21 |
|
6 |
2 |
almost 13 years ago |
3 |
July 01, 2013 |
0 |
mit |
JavaScript |
| Count-Min Sketch Data Structure |
| vega/datalib-sketch |
17 |
|
0 |
3 |
almost 9 years ago |
11 |
December 16, 2016 |
2 |
bsd-3-clause |
JavaScript |
| Probabilistic data structures for large or streaming data sets. |
| kalaidin/sketches |
13 |
|
0 |
0 |
over 11 years ago |
0 |
|
0 |
|
Python |
| HyperLogLog and other probabilistic data structures for mining in data streams |
| kampersanda/dyft |
5 |
|
0 |
0 |
over 4 years ago |
0 |
|
0 |
mit |
C++ |
| C++17 Implementation of Dynamic Filter Trie |
