Alternatives and similar repositories for quantiles:

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

• hit9 / htree
  Package htree implements the in-memory hash tree. Hacker News: https://news.ycombinator.com/item?id=11369676
  ☆92Updated 2 years ago
• seiflotfy / pcsa
  ☆37Updated 6 years ago
• seiflotfy / adaptive
  Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams
  ☆37Updated 7 years ago
• seiflotfy / hyperbitbit
  HyperBitBit
  ☆133Updated 8 years ago
• axiomhq / hyperminhash
  HyperMinHash: Bringing intersections to HyperLogLog
  ☆304Updated 7 years ago
• steve0hh / midas
  Go implementation of MIDAS: Microcluster-Based Detector of Anomalies in Edge Streams
  ☆188Updated 4 years ago
• dgryski / go-bloomindex
  Bloom-filter based search index
  ☆122Updated 3 years ago
• vedhavyas / cuckoo-filter
  Cuckoo Filter: Practically better than bloom filter
  ☆81Updated 5 years ago
• seiflotfy / loglogbeta
  LogLog based Cardinality Estimator
  ☆62Updated 7 years ago
• traildb / traildb-go
  Go bindings for TrailDB
  ☆47Updated 5 years ago
• dustin / go-probably
  Probabilistic Data Structures for Go
  ☆255Updated 6 years ago
• google-deepmind / objecthash-proto
  ObjectHash for protocol buffers
  ☆88Updated 4 years ago
• google / fchan-go
  Experimental channel implementation
  ☆311Updated 8 years ago
• slobdell / skew-binomial-queues
  ☆63Updated 2 years ago
• lytics / hll
  HyperLogLog++ for Go
  ☆43Updated 6 years ago
• F483 / dejavu
  Quickly detect already witnessed data.
  ☆158Updated 8 months ago
• cockroachdb / rpc-bench
  Benchmarking various RPC implementations
  ☆89Updated 4 years ago
• steveyen / gtreap
  gtreap is an immutable treap implementation in the Go Language
  ☆90Updated 3 years ago
• seiflotfy / pmc
  Probabilistic Multiplicity Counting
  ☆49Updated 9 years ago
• VividCortex / gohistogram
  Streaming approximate histograms in Go
  ☆175Updated 4 years ago
• bjwbell / gensimd
  SIMD for Go
  ☆162Updated 7 years ago
• axiomhq / flipcounter
  A counter data structure that knows when to start estimating to save space
  ☆35Updated 7 years ago
• ashishgandhi / buffer
  A file backed circular buffer for Go. Mmap file into memory. Madvise to lower memory footprint.
  ☆81Updated 5 months ago
• ozlo / gown
  A Go implementation of the WordNet API
  ☆39Updated 6 years ago
• tidwall / celltree
  A fast in-memory prefix tree that uses uint64 for keys and allows for duplicate entries.
  ☆201Updated 4 years ago
• seiflotfy / dlCBF
  d-left Counting Bloom Filter
  ☆56Updated 9 years ago
• vedhavyas / cuckooc
  A service to manage your Cuckoo filters
  ☆18Updated 7 years ago
• seiflotfy / count-min-log
  Go implementation of Count-Min-Log
  ☆67Updated last month
• colinjfw / sqlkit
  SQL builder and powerful database toolkit for Golang
  ☆119Updated 5 years ago
• spenczar / tdigest
  Fast approximate quantiles in Go
  ☆127Updated 2 years ago