This is an automated email from the ASF dual-hosted git repository.

git-site-role pushed a commit to branch asf-site
in repository 
https://gitbox.apache.org/repos/asf/incubator-datasketches-website.git


The following commit(s) were added to refs/heads/asf-site by this push:
     new 0f44024  Automatic Site Publish by Buildbot
0f44024 is described below

commit 0f44024243b16d19088a9c5f90094c771088b41e
Author: buildbot <[email protected]>
AuthorDate: Tue May 26 17:53:08 2020 +0000

    Automatic Site Publish by Buildbot
---
 output/docs/Architecture/MajorSketchFamilies.html | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/output/docs/Architecture/MajorSketchFamilies.html 
b/output/docs/Architecture/MajorSketchFamilies.html
index b1bcb32..5eabb1d 100644
--- a/output/docs/Architecture/MajorSketchFamilies.html
+++ b/output/docs/Architecture/MajorSketchFamilies.html
@@ -507,12 +507,12 @@
     under the License.
 -->
 
-<h1 id="high-level-descriptions">High-Level Descriptions</h1>
+<h1 id="major-sketch-families">Major Sketch Families</h1>
 <p>Please see the <a 
href="/docs/Architecture/SketchFeaturesMatrix.html">Sketch Features Matrix</a> 
for a detailed comparison of the features of the different sketches in the 
library.</p>
 
 <h2 id="cardinality-sketches">Cardinality Sketches</h2>
 
-<h3 
id="cpc-sketchdocscpccpchtml-estimating-stream-cardinalities-more-efficiently-than-the-famous-hll-sketch">[CPC
 Sketch}(/docs/CPC/CPC.html): Estimating Stream Cardinalities more efficiently 
than the famous HLL sketch!</h3>
+<h3 
id="cpc-sketch-estimating-stream-cardinalities-more-efficiently-than-the-famous-hll-sketch"><a
 href="/docs/CPC/CPC.html">CPC Sketch</a>: Estimating Stream Cardinalities more 
efficiently than the famous HLL sketch!</h3>
 <p>This sketch was developed by the late Keven J. Lang, our chief scientist at 
the time. It is an amazing <em>tour de force</em> of scientific design and 
engineering and has substantially better accuracy / per stored size than the 
famous HLL sketch. The theory and demonstration of its performance is detailed 
in Lang’s paper <a href="https://arxiv.org/abs/1708.06839";>Back to the Future: 
an Even More Nearly Optimal Cardinality Estimation Algorithm</a>.</p>
 
 <h3 id="theta-sketches-estimating-stream-expression-cardinalities"><a 
href="/docs/Theta/ThetaSketchFramework.html">Theta Sketches</a>: Estimating 
Stream Expression Cardinalities</h3>


---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]

Reply via email to