PTransform
s for computing the approximate number of distinct elements in a stream.Combine.CombineFn
of ApproximateDistinct
transforms.ApproximateDistinct.globally()
.HyperLogLogPlus
class.ApproximateDistinct.perKey()
.ApproximateDistinct.ApproximateDistinctFn
combiner with the given input coder.SketchFrequencies.CountMinSketchFn
combiner with the given input coder.TDigestQuantiles.TDigestQuantilesFn
combiner with the given compression factor.CountMinSketch
.PCollection<InputT>
and returns a PCollection<Long>
.PTransform
that will build a Count-min sketch for keeping track of the
frequency of the elements in the whole stream.PCollection<MergingDigest>
.ApproximateDistinct.globally()
but per key, i.e computes the approximate number of distinct values per
key in a PCollection<KV<K, V>>
and returns PCollection<KV<K, Long>>
.SketchFrequencies.globally()
but per key, i.e a Count-min sketch per key in PCollection<KV<K, V>>
and returns a PCollection<KV<K, {@link CountMinSketch}>>
.TDigestQuantiles.globally()
, but builds a digest for each key in the stream.PTransform
s to compute the estimate frequency of each element in a stream.Combine.CombineFn
of SketchFrequencies
transforms.SketchFrequencies.globally()
.SketchFrequencies.perKey()
.PTransform
s for getting information about quantiles in a stream.TDigestQuantiles.globally()
.TDigestQuantiles.perKey()
.Combine.CombineFn
of TDigestQuantiles
transforms.SketchFrequencies.CountMinSketchFn
combiner with new precision accuracy parameters epsilon
and confidence
.cf
.cf
.confidence
value, i.e.confidence
value, i.e.ApproximateDistinct.ApproximateDistinctFn
combiner with a new precision p
.p
.p
.epsilon
.epsilon
.sp
.sp
.ApproximateDistinct.ApproximateDistinctFn
combiner with a new sparse representation's
precision sp
.