Alternatives and similar repositories for tdigest

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

• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆58Updated 6 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• smyte / smyte-db
  Central build environment for Smyte C++ projects.
  ☆47Updated 6 years ago
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆174Updated 13 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆135Updated 4 years ago
• phaistos-networks / ConsistentHashing
  Consistent Hashing data structures and algorithms for C++
  ☆39Updated 8 years ago
• sengelha / streaming-percentiles
  Cross-platform, multi-language implementation of multiple streaming percentile algorithms
  ☆62Updated 2 years ago
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆46Updated 5 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• andy-yx-chen / cornerstone
  A C++ Raft implementation, project moved
  ☆24Updated 8 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆174Updated 8 years ago
• izenecloud / izenelib
  General purpose C++ library for iZENECloud
  ☆42Updated 10 years ago
• HdrHistogram / HdrHistogram_c
  C port of the HdrHistogram
  ☆246Updated 6 months ago
• 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
  ☆53Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• gpichot / cpp-tdigest
  [Not maintained] Implementation of TDigest algorithm in C++
  ☆16Updated 8 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆46Updated 2 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆74Updated 6 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆159Updated last year
• HBPVIS / ZeroBuf
  zero-copy, zero-serialize, zero-hassle protocol buffers
  ☆56Updated 7 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• MorphStore / TVLLib
  Template Vector Library
  ☆18Updated 3 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago