Examples of com.proofpoint.stats.QuantileDigest$Bucket

net.noderunner.amazon.s3.Bucket

eerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.7343, a data structure for approximating quantiles by trading off error with memory requirements.

The size of the digest is adjusted dynamically to achieve the error bound and requires O(log2(U) / maxError) space, where U is the number of bits needed to represent the domain of the values added to the digest. The error is defined as the discrepancy between the real rank of the value returned in a quantile query and the rank corresponding to the queried quantile.

Thus, for a query for quantile q that returns value v, the error is |rank(v) - q * N| / N, where N is the number of elements added to the digest and rank(v) is the real rank of v

This class also supports exponential decay. The implementation is based on the ideas laid out in http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.3978

   }


   private void setBucket(String s)
   {
      if (s != null)
         setBucket(new Bucket(s));
   }

   }


   private void setBucket(String s)
   {
      if (s != null)
         setBucket(new Bucket(s));
   }

Examples of com.proofpoint.stats.QuantileDigest$Bucket

Related Classes of com.proofpoint.stats.QuantileDigest$Bucket