Alternatives and similar repositories for streaming-percentiles

Users that are interested in streaming-percentiles are comparing it to the libraries listed below

• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆286Updated 2 months 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…
  ☆116Updated 9 months ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆173Updated 5 years ago
• google / hashtable-benchmarks
  ☆110Updated last year
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆143Updated 6 years ago
• derrickburns / tdigest
  C++ version of Ted Dunning's merging t-digest
  ☆27Updated 5 years ago
• LLNL / metall
  Persistent memory allocator for data-centric analytics
  ☆56Updated 2 weeks ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• hideo55 / cpp-HyperLogLog
  C++ implementation of HyperLogLog
  ☆60Updated last year
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 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
  ☆53Updated last year
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 6 months ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆50Updated 4 months ago
• andybbruno / TSXor
  TSXor: A Simple Time Series Compression Algorithm
  ☆53Updated 8 months ago
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆156Updated 3 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
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• martinus / map_benchmark
  Comprehensive benchmarks of C++ maps
  ☆315Updated 2 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆16Updated 11 years ago
• lemire / Concise
  C++ implementation of Concise and WAH compressed bitsets
  ☆20Updated 8 years ago
• kiyo-masui / bitshuffle
  Filter for improving compression of typed binary data.
  ☆230Updated 9 months 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…
  ☆78Updated 4 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 7 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated last year
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆62Updated 6 years ago