count.count.count.count.count.DDSketch, with high ingestion speed and low memory footprint.DDSketch, with high ingestion speed and low memory footprint,, using
a limited number of bins.DDSketch, with high ingestion speed and low memory footprint, using
a limited number of bins.IndexMapping that approximates the memory-optimal one (namely LogarithmicMapping) by
extracting the floor value of the logarithm to the base 2 from the binary representations of floating-point values
and linearly interpolating the logarithm in-between using, again, the binary representation.IndexMapping that approximates the memory-optimal one (namely LogarithmicMapping) by
extracting the floor value of the logarithm to the base 2 from the binary representations of floating-point values
and cubically interpolating the logarithm in-between.QuantileSketch with relative-error guarantees.IndexMapping and Store
supplier.IndexMapping and Store
supplier.DDSketch, with optimized ingestion speed, at the cost of higher memory
usage.DDSketch, with optimized ingestion speed, at the cost of higher memory
usage, using a limited number of bins.DDSketch, with optimized ingestion speed, at the cost of higher memory
usage, using a limited number of bins.DDSketch based on the provided protobuf representation, assuming it encodes
non-negative values only.IndexMapping that matches the provided protobuf representation.SignedDDSketch based on the provided protobuf representation.Store based on the provided protobuf representation.double values and int values that imposes relative guarantees on the composition
of IndexMapping.value(int) and IndexMapping.index(double).IndexMapping that approximates the memory-optimal one (namely LogarithmicMapping) by
extracting the floor value of the logarithm to the base 2 from the binary representations of floating-point values
and linearly interpolating the logarithm in-between.IndexMapping that is memory-optimal, that is to say that given a targeted relative accuracy, it
requires the least number of indices to cover a given range of values.DDSketch, with optimized memory usage, at the cost of lower
ingestion speed.DDSketch, with optimized memory usage, at the cost of lower
ingestion speed, using a limited number of bins.DDSketch, with optimized memory usage, at the cost of lower
ingestion speed, using a limited number of bins.IndexMapping that approximates the memory-optimal one (namely LogarithmicMapping) by
extracting the floor value of the logarithm to the base 2 from the binary representations of floating-point values
and quadratically interpolating the logarithm in-between.double values and can compute quantiles over the ingested values.QuantileSketch with the same relative-error guarantees as DDSketch, but accepts
both negative and positive input values.IndexMapping and
Store supplier.IndexMapping and
Store suppliers.IndexMapping and Store
supplier.DDSketch.IndexMapping.SignedDDSketch.Store.