Package | Description |
---|---|
com.clearspring.analytics.stream.cardinality |
Modifier and Type | Class and Description |
---|---|
class |
AdaptiveCounting
Based on the adaptive counting approach of:
Fast and Accurate Traffic Matrix Measurement Using Adaptive Cardinality Counting by: Cai, Pan, Kwok, and Hwang |
class |
CountThenEstimate
Exact -> Estimator cardinality counting
|
class |
HyperLogLog
Java implementation of HyperLogLog (HLL) algorithm from this paper:
http://algo.inria.fr/flajolet/Publications/FlFuGaMe07.pdf
HLL is an improved version of LogLog that is capable of estimating
the cardinality of a set with accuracy = 1.04/sqrt(m) where
m = 2^b.
|
class |
HyperLogLogPlus
Implementation of HyperLogLog++ described in
|
class |
LinearCounting
See A Linear-Time Probabilistic Counting Algorithm for Database Applications
by Whang, Vander-Zanden, Taylor
|
class |
LogLog |
Modifier and Type | Field and Description |
---|---|
protected ICardinality |
CountThenEstimate.estimator
Cardinality estimator
Null until tipping point is reached
|
Modifier and Type | Field and Description |
---|---|
protected IBuilder<ICardinality> |
CountThenEstimate.builder
Factory for instantiating estimator after the tipping point is reached
|
Modifier and Type | Method and Description |
---|---|
ICardinality |
HyperLogLogPlus.merge(ICardinality... estimators)
Merge this HLL++ with a bunch of others! The power of minions!
Most of the logic consists of case analysis about the state of this HLL++ and each one it wants to merge
with.
|
ICardinality |
ICardinality.merge(ICardinality... estimators)
Merges estimators to produce a new estimator for the combined streams
of this estimator and those passed as arguments.
|
ICardinality |
LinearCounting.merge(ICardinality... estimators) |
ICardinality |
HyperLogLog.merge(ICardinality... estimators) |
ICardinality |
LogLog.merge(ICardinality... estimators) |
ICardinality |
CountThenEstimate.merge(ICardinality... estimators) |
ICardinality |
AdaptiveCounting.merge(ICardinality... estimators) |
Modifier and Type | Method and Description |
---|---|
static IBuilder<ICardinality> |
AdaptiveCounting.Builder.obyCount(long maxCardinality)
For cardinalities less than 4.25M, obyCount provides a LinearCounting Builder
(see LinearCounting.Builder.onePercentError() ) using only the
space required to provide estimates within 1% of the actual cardinality,
up to ~65k.
|
Modifier and Type | Method and Description |
---|---|
ICardinality |
HyperLogLogPlus.merge(ICardinality... estimators)
Merge this HLL++ with a bunch of others! The power of minions!
Most of the logic consists of case analysis about the state of this HLL++ and each one it wants to merge
with.
|
ICardinality |
ICardinality.merge(ICardinality... estimators)
Merges estimators to produce a new estimator for the combined streams
of this estimator and those passed as arguments.
|
ICardinality |
LinearCounting.merge(ICardinality... estimators) |
ICardinality |
HyperLogLog.merge(ICardinality... estimators) |
ICardinality |
LogLog.merge(ICardinality... estimators) |
ICardinality |
CountThenEstimate.merge(ICardinality... estimators) |
ICardinality |
AdaptiveCounting.merge(ICardinality... estimators) |
Constructor and Description |
---|
CountThenEstimate(int tippingPoint,
IBuilder<ICardinality> builder) |
Copyright © 2019. All rights reserved.