Alternatives and similar repositories for cpp-tdigest:

Users that are interested in cpp-tdigest are comparing it to the libraries listed below

• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆51Updated 10 months ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• derrickburns / tdigest
  C++ version of Ted Dunning's merging t-digest
  ☆27Updated 4 years ago
• espindola / cthulhu
  ☆12Updated last year
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 10 months ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 4 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆51Updated 7 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• discretelogics / TeaFiles.Cpp-Time-Series-Storage-in-Files
  C++ API for the TeaFile File Format. TeaFiles is Time Series Persistence in Flat Files.
  ☆60Updated 3 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 7 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• shaovoon / floatbench
  String to Float Benchmark
  ☆19Updated 6 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• andralex / MedianOfNinthers
  ☆49Updated 4 years ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆21Updated 4 years ago
• paulross / skiplist
  A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!
  ☆47Updated 5 months ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• det / segmented_tree
  Sequence data structure with efficient random access insert and erase
  ☆13Updated last year
• STEllAR-GROUP / hpxcl
  This repository contains components that will support percolation via OpenCL and CUDA
  ☆31Updated 3 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• tudocomp / compact_sparse_hash
  A blend of the compact and sparse hash table implementations.
  ☆12Updated 3 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• jasonge27 / fastQuantile
  Memory Efficient Quantile Approximator for High Speed Data Streams
  ☆21Updated 8 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆28Updated 2 years ago
• KevinStern / index-cpp
  C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…
  ☆75Updated 4 years ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago