1-dimensional non-rebinnable bin holding double elements with
scalable quantile operations defined upon; Using little main memory, quickly
computes approximate quantiles over very large data sequences with and even
without a-priori knowledge of the number of elements to be filled;
Conceptually a strongly lossily compressed multiset (or bag); Guarantees to
respect the worst case approximation error specified upon instance
construction.
1-dimensional non-rebinnable bin holding float elements with
scalable quantile operations defined upon; Using little main memory, quickly
computes approximate quantiles over very large data sequences with and even
without a-priori knowledge of the number of elements to be filled;
Conceptually a strongly lossily compressed multiset (or bag); Guarantees to
respect the worst case approximation error specified upon instance
construction.