The Optimal Quantile Estimator for Compressed Counting

Details The Optimal Quantile Estimator for Compressed Counting The Optimal Quantile Estimator for Compressed Counting

2008-08-13

arxiv.org/abs/0808.1766v1

Computer Science

Data Structures and Algorithms

Scientific paper

Compressed Counting (CC) was recently proposed for very efficiently computing the (approximate) $\alpha$th frequency moments of data streams, where $0<\alpha <= 2$. Several estimators were reported including the geometric mean estimator, the harmonic mean estimator, the optimal power estimator, etc. The geometric mean estimator is particularly interesting for theoretical purposes. For example, when $\alpha -> 1$, the complexity of CC (using the geometric mean estimator) is $O(1/\epsilon)$, breaking the well-known large-deviation bound $O(1/\epsilon^2)$. The case $\alpha\approx 1$ has important applications, for example, computing entropy of data streams. For practical purposes, this study proposes the optimal quantile estimator. Compared with previous estimators, this estimator is computationally more efficient and is also more accurate when $\alpha> 1$.

Affiliated with

Also associated with

No associations

Rating

The Optimal Quantile Estimator for Compressed Counting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Optimal Quantile Estimator for Compressed Counting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Optimal Quantile Estimator for Compressed Counting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-386342