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