jasonge27 / fastQuantile
Memory Efficient Quantile Approximator for High Speed Data Streams
☆22Updated 7 years ago
Related projects: ⓘ
- header only essentials of QuantLib☆24Updated 6 years ago
- C++ API for the TeaFile File Format. TeaFiles is Time Series Persistence in Flat Files.☆60Updated 2 years ago
- A C++ library for summarizing data streams☆24Updated 5 years ago
- Implementation of QuadSketch algorithm☆11Updated last year
- Fast integer to string and string to integer conversion functions☆18Updated 11 months ago
- Tick-to-trade latency benchmark sources☆15Updated 6 years ago
- Tick, a market data tool.☆18Updated 11 years ago
- Red/black tree with support for fast accumulation of values in a key range☆18Updated 4 years ago
- C++11 tools for low latency systems. LMAX Disruptor, Ring, Ring Allocator.☆31Updated 4 years ago
- Query processing for an extremely simple, in-memory, columnar database using Apache Arrow to represent tables☆22Updated 2 years ago
- ye olde time_series library, now unmaintained☆15Updated 11 years ago
- ☆17Updated 2 years ago
- MonetDB as a shared library with a C API☆33Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆38Updated 4 years ago
- [Not maintained] Implementation of TDigest algorithm in C++☆16Updated 7 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆24Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- General purpose C++ library for iZENECloud☆42Updated 9 years ago
- Very Fast Machine Learning Toolkit☆27Updated 11 years ago
- R package for fitting the partially cointegrated model☆14Updated last year
- Chronicle memory-mapped message journal in Python☆14Updated 3 years ago
- ☆31Updated this week
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 5 months ago
- Suite of universal indexes for Highly Repetitive Document Collections☆19Updated 4 years ago
- ☆32Updated 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆84Updated 3 years ago
- Order Book Implementation☆25Updated 11 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- Linear vs binary search benchmark☆40Updated 4 years ago
- C++ file backed vector for very fast column databases, useful for time series data☆22Updated 9 years ago