Alternatives and similar repositories for streaming-quantiles:

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

• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• DataDog / sketches-py
  Python implementations of the distributed quantile sketch algorithm DDSketch
  ☆86Updated 5 months ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆38Updated 6 years ago
• dgryski / hokusai
  hokusai -- sketching streams in real-time
  ☆78Updated 7 years ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆45Updated 6 years ago
• stanford-futuredata / msketch
  Moments Sketch Code
  ☆40Updated 6 years ago
• searchivarius / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆58Updated last year
• jasonge27 / fastQuantile
  Memory Efficient Quantile Approximator for High Speed Data Streams
  ☆21Updated 8 years ago
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆24Updated 5 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆58Updated last week
• brentp / fastbit-python
  pythonic access to fastbit
  ☆26Updated 6 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• coolwanglu / quantile-alg
  Algorithms for finding quantiles of a data stream
  ☆19Updated 11 years ago
• xdata-skylark / libskylark
  Sketching-based Distributed Matrix Computations for Machine Learning
  ☆99Updated 6 years ago
• tkluck / accumulation_tree
  Red/black tree with support for fast accumulation of values in a key range
  ☆18Updated 4 months ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 10 years ago
• seiflotfy / cmts
  Count-Min Tree Sketch: Approximate counting for NLP
  ☆10Updated 7 years ago
• rdspring1 / MISSION
  MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
  ☆13Updated 5 years ago
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆61Updated 3 years ago
• All-less / continuum
  A platform for online learning that curtails data latency and saves you cost.
  ☆47Updated 3 years ago
• dnbaker / frp
  FRP: Fast Random Projections
  ☆43Updated 4 years ago
• stanford-futuredata / momentsketch
  Simplified Moment Sketch Implemntation
  ☆36Updated 6 years ago
• rasmus-pagh / coveringLSH
  Simple implementation of CoveringLSH
  ☆11Updated 9 years ago
• umbrant / QuantileEstimation
  Streaming estimation of percentiles, especially high percentiles.
  ☆63Updated 12 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆85Updated 4 years ago
• ucbrise / fluent-old
  Bloom + C++
  ☆17Updated 7 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• shivin9 / CAC
  A Clustering Based Classification Algorithm
  ☆28Updated 3 years ago
• gingsmith / cocoa
  communication-efficient distributed coordinate ascent
  ☆90Updated 5 years ago