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
  ☆63Updated 7 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• google / hashtable-benchmarks
  ☆112Updated last year
• sears / bLSM
  Read- and latency-optimized log structured merge tree
  ☆175Updated 13 years ago
• sengelha / streaming-percentiles
  Cross-platform, multi-language implementation of multiple streaming percentile algorithms
  ☆65Updated 2 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆117Updated last year
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆167Updated last month
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• HdrHistogram / HdrHistogram_c
  C port of the HdrHistogram
  ☆264Updated 4 months ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 4 months ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 5 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆127Updated 5 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆33Updated 4 years 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
  ☆54Updated last year
• paulross / skiplist
  A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!
  ☆50Updated 8 months ago
• kiyo-masui / bitshuffle
  Filter for improving compression of typed binary data.
  ☆232Updated last year
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆174Updated 5 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• rmind / libqsbr
  QSBR and EBR library
  ☆135Updated 6 years ago
• sfu-dis / corobase
  Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)
  ☆251Updated 4 years ago
• jfuentes / concurrent-data-structures
  Compilation of concurrent data structures with at least lock-free or wait-free properties.
  ☆76Updated 6 years ago
• smyte / smyte-db
  Central build environment for Smyte C++ projects.
  ☆47Updated 7 years ago
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆159Updated 3 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆31Updated 15 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• PlatformLab / PerfUtils
  A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.
  ☆42Updated last year
• mozafari / vprofiler
  A Profiler for Identifying the Major Sources of Performance Variance in Modern Applications
  ☆95Updated 7 years ago