Package org.apache.datasketches.cpc
Compressed Probabilistic Counting sketch family
-
Class Summary Class Description CompressionCharacterization This code is used both by unit tests, for short running tests, and by the characterization repository for longer running, more exhaustive testing.CpcSketch This is a unique-counting sketch that implements the Compressed Probabilistic Counting (CPC, a.k.a FM85) algorithms developed by Kevin Lang in his paper Back to the Future: an Even More Nearly Optimal Cardinality Estimation Algorithm.CpcUnion The union (merge) operation for the CPC sketches.CpcWrapper This provides a read-only view of a serialized image of a CpcSketch, which can be on-heap or off-heap represented as a Memory object, or on-heap represented as a byte array.MergingValidation This code is used both by unit tests, for short running tests, and by the characterization repository for longer running, more exhaustive testing.QuickMergingValidation This code is used both by unit tests, for short running tests, and by the characterization repository for longer running, more exhaustive testing.StreamingValidation This code is used both by unit tests, for short running tests, and by the characterization repository for longer running, more exhaustive testing.TestUtil