stanford-futuredata / msketchView external linksLinks
Moments Sketch Code
☆40Oct 31, 2018Updated 7 years ago
Alternatives and similar repositories for msketch
Users that are interested in msketch are comparing it to the libraries listed below
Sorting:
- Simplified Moment Sketch Implemntation☆36Jan 22, 2019Updated 7 years ago
- Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams☆37Jun 3, 2017Updated 8 years ago
- Bloom + C++☆17Sep 12, 2017Updated 8 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Oct 7, 2019Updated 6 years ago
- A golang streaming histogram sketch. Fast quantiles and counts below a threshold.☆45Jun 10, 2023Updated 2 years ago
- ☆11Sep 22, 2017Updated 8 years ago
- Memory Efficient Quantile Approximator for High Speed Data Streams☆22Sep 29, 2016Updated 9 years ago
- Perseus is a set of scripts (docker+javascript) to investigate a distributed database's responsiveness when one of its three nodes is iso…☆49Mar 29, 2019Updated 6 years ago
- dynamic-updateable-index☆11Nov 10, 2015Updated 10 years ago
- A C implementation of Google's Open Location Code☆10Mar 23, 2018Updated 7 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- An implementation and example of Partial Key Grouping for Apache Storm. Partial Key Grouping is a load balancing strategy for distributed…☆15Sep 14, 2015Updated 10 years ago
- Go wrapper for Apache Arrow C++☆15Aug 24, 2021Updated 4 years ago
- A Go DataFrame built on Apache Arrow☆12Jul 7, 2020Updated 5 years ago
- Unix look utility analog which is blazingly fast and works with big files☆18May 27, 2022Updated 3 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Jun 13, 2020Updated 5 years ago
- Relative data structures based on the BWT☆12Apr 28, 2018Updated 7 years ago
- Optimal Quantile Approximation in Streams☆163Feb 15, 2023Updated 3 years ago
- exponential smoothing toolkit☆15Jul 8, 2016Updated 9 years ago
- LIBBLE by Parameter Server☆17Sep 17, 2018Updated 7 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24May 14, 2020Updated 5 years ago
- Bridge between Go and Python to facilitate zero-copy using Apache Arrow☆20Jul 23, 2019Updated 6 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Dec 9, 2023Updated 2 years ago
- A fast collection type that uses uint64 for keys.☆44Nov 3, 2020Updated 5 years ago
- ☆50Apr 11, 2024Updated last year
- A Go implementation of OpenHistogram log-linear histograms☆91Jan 28, 2025Updated last year
- Generic Model Serving Implementation leveraging Flink☆19Jan 3, 2019Updated 7 years ago
- ☆22Apr 24, 2016Updated 9 years ago
- deterministic subsetting☆24Mar 29, 2018Updated 7 years ago
- ☆20Aug 18, 2020Updated 5 years ago
- Bloofi: A java implementation of multidimensional Bloom filters☆85Jul 1, 2025Updated 7 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Sep 12, 2022Updated 3 years ago
- A simple implementation of the write-optimized Bε Tree 🌳 - for MIT 6.854 (Advanced Algorithms).☆26Dec 27, 2019Updated 6 years ago
- A minimal OCaml library for type-safe HTTP/JSON RPCs☆18Sep 11, 2019Updated 6 years ago
- ☆23Jul 29, 2016Updated 9 years ago
- Succinct C++☆24Sep 13, 2020Updated 5 years ago
- GraphPipe for go☆65May 24, 2019Updated 6 years ago
- Experiments in partially ordered SMR.☆48Mar 24, 2021Updated 4 years ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆27Apr 11, 2019Updated 6 years ago