| caio/go-tdigest |
102 |
|
22 |
161 |
over 2 years ago |
20 |
October 10, 2022 |
0 |
mit |
Go |
| A T-Digest implementation in golang |
| 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. |
| travisbrady/flajolet |
37 |
|
0 |
0 |
about 8 years ago |
0 |
|
2 |
|
OCaml |
| Probabilistic data structures for OCaml |
| zensors/datatap-python |
37 |
|
0 |
0 |
over 3 years ago |
25 |
May 17, 2022 |
1 |
gpl-3.0 |
Python |
| Focus on Algorithm Design, Not on Data Wrangling |
| timothypratley/patchin |
19 |
|
8 |
0 |
about 11 years ago |
7 |
October 05, 2015 |
0 |
epl-1.0 |
Clojure |
| Creates and applies patches to datastructures |
| 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. |
