jasonge27 / fastQuantile
Memory Efficient Quantile Approximator for High Speed Data Streams
☆21Updated 8 years ago
Alternatives and similar repositories for fastQuantile:
Users that are interested in fastQuantile are comparing it to the libraries listed below
- A C++ library for summarizing data streams☆24Updated 5 years ago
- General purpose C++ library for iZENECloud☆42Updated 9 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.☆23Updated 7 years ago
- C++11 library for fast fuzzy searching☆14Updated 9 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!☆47Updated 5 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- MonetDB as a shared library with a C API☆33Updated 3 years ago
- Red/black tree with support for fast accumulation of values in a key range☆18Updated 4 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- ☆49Updated 4 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆57Updated 8 months ago
- A C++ library for lightning fast multi-threaded serialization of tabular data. Home to the `fst` file format.☆37Updated last year
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆51Updated 11 months ago
- Sample database with LLVM execution engine.☆11Updated 8 years ago
- ☆13Updated 6 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 9 months ago
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆54Updated 2 years ago
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 3 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- Succinct C++☆25Updated 4 years ago
- [Not maintained] Implementation of TDigest algorithm in C++☆16Updated 7 years ago
- header only essentials of QuantLib☆26Updated 7 years ago
- Chronicle memory-mapped message journal in Python☆14Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆39Updated 10 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year