Package org.apache.datasketches.cpc


package org.apache.datasketches.cpc
Compressed Probabilistic Counting sketch family
  • Classes
    Class
    Description
    This code is used both by unit tests, for short running tests, and by the characterization repository for longer running, more exhaustive testing.
    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.
    The union (merge) operation for the CPC sketches.
    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.
    This code is used both by unit tests, for short running tests, and by the characterization repository for longer running, more exhaustive testing.
    This code is used both by unit tests, for short running tests, and by the characterization repository for longer running, more exhaustive testing.
    This code is used both by unit tests, for short running tests, and by the characterization repository for longer running, more exhaustive testing.