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.2.1.tar.gz md5=b1e6a1105a0ff82ea56bb1f9391d0330 sha512=b632c721556cafd94f8b7493b737cc3b77cd440883fd216702b91cf4a717a424798b1f9b5f2d80196b6825a17993caf61b26f582a8c4d9470ce491d68663c6af |
Edit | https://github.com/ocaml/opam-repository/tree/master/packages/tdigest/tdigest.2.2.1/opam |
No package is dependent