tdigestversion
OCaml implementation of the T-Digest algorithm
The T-Digest is a data structure and algorithm for constructing an approximate distribution for a collection of real numbers presented as a stream.
The T-Digest can estimate percentiles or quantiles extremely accurately even at the tails, while using a fraction of the space.
Additionally, the T-Digest is concatenable, making it a good fit for distributed systems. The internal state of a T-Digest can be exported as a binary string, and the concatenation of any number of those strings can then be imported to form a new T-Digest.
Authors | Simon Grondin and Will Welch |
---|---|
License | MIT |
Published | |
Homepage | https://github.com/SGrondin/tdigest |
Issue Tracker | https://github.com/SGrondin/tdigest/issues |
Maintainer | Simon Grondin |
Dependencies | |
Source [http] | https://github.com/SGrondin/tdigest/archive/refs/tags/2.1.2.tar.gz md5=1f200a6b32f0d19ee0e33d77584fa9bc sha512=8649e06a21f602c084c85c21f5d98a9f9332d603cc5bfda994566c9620f73863d0bf741bd322015dffa5ab1c26c42b97faead69dc1d514128eeb592e06f81847 |
Edit | https://github.com/ocaml/opam-repository/tree/master/packages/tdigest/tdigest.2.1.2/opam |
No package is dependent