Alternatives and similar repositories for fastQuantile:

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

• 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
• andralex / MedianOfNinthers
  ☆49Updated 5 years ago
• MonetDB / MonetDBLite-C
  MonetDB as a shared library with a C API
  ☆33Updated 3 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 9 years ago
• pcaspers / Quantuccia
  header only essentials of QuantLib
  ☆23Updated 7 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 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
• stanford-futuredata / msketch
  Moments Sketch Code
  ☆40Updated 6 years ago
• izenecloud / izenelib
  General purpose C++ library for iZENECloud
  ☆42Updated 10 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆24Updated 5 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• tkluck / accumulation_tree
  Red/black tree with support for fast accumulation of values in a key range
  ☆18Updated 7 months ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆25Updated last month
• lemire / PiecewiseLinearTimeSeriesApproximation
  code from Daniel Lemire, A Better Alternative to Piecewise Linear Time Series Segmentation, SIAM Data Mining 2007, 2007.
  ☆25Updated 7 years ago
• gpichot / cpp-tdigest
  [Not maintained] Implementation of TDigest algorithm in C++
  ☆16Updated 8 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• TU-Berlin-DIMA / OpenCL-SIMD-hashing
  This repository contains our work on efficient SIMD vectorization methods for hashing in OpenCL. It was first published at the 21th Inter…
  ☆11Updated 6 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• spirom / arrow-simpledb
  Query processing for an extremely simple, in-memory, columnar database using Apache Arrow to represent tables
  ☆22Updated 3 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 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
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆61Updated 5 years ago
• queertypes / boost-bloom-filters
  A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.
  ☆23Updated 7 years ago
• jontuk / pychro
  Chronicle memory-mapped message journal in Python
  ☆14Updated 3 years ago