Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p><a href="http://jsfiddle.net/mM6bY/4/" rel="noreferrer">Here</a> it is the updated version of the algorithm based on the <a href="http://algo.inria.fr/flajolet/Publications/FlFuGaMe07.pdf" rel="noreferrer">newer paper</a>:</p> <pre><code>var pow_2_32 = 0xFFFFFFFF + 1; function HyperLogLog(std_error) { function log2(x) { return Math.log(x) / Math.LN2; } function rank(hash, max) { var r = 1; while ((hash &amp; 1) == 0 &amp;&amp; r &lt;= max) { ++r; hash &gt;&gt;&gt;= 1; } return r; } var m = 1.04 / std_error; var k = Math.ceil(log2(m * m)), k_comp = 32 - k; m = Math.pow(2, k); var alpha_m = m == 16 ? 0.673 : m == 32 ? 0.697 : m == 64 ? 0.709 : 0.7213 / (1 + 1.079 / m); var M = []; for (var i = 0; i &lt; m; ++i) M[i] = 0; function count(hash) { if (hash !== undefined) { var j = hash &gt;&gt;&gt; k_comp; M[j] = Math.max(M[j], rank(hash, k_comp)); } else { var c = 0.0; for (var i = 0; i &lt; m; ++i) c += 1 / Math.pow(2, M[i]); var E = alpha_m * m * m / c; // -- make corrections if (E &lt;= 5/2 * m) { var V = 0; for (var i = 0; i &lt; m; ++i) if (M[i] == 0) ++V; if (V &gt; 0) E = m * Math.log(m / V); } else if (E &gt; 1/30 * pow_2_32) E = -pow_2_32 * Math.log(1 - E / pow_2_32); // -- return E; } } return {count: count}; } function fnv1a(text) { var hash = 2166136261; for (var i = 0; i &lt; text.length; ++i) { hash ^= text.charCodeAt(i); hash += (hash &lt;&lt; 1) + (hash &lt;&lt; 4) + (hash &lt;&lt; 7) + (hash &lt;&lt; 8) + (hash &lt;&lt; 24); } return hash &gt;&gt;&gt; 0; } var words = ['aardvark', 'abyssinian', ..., 'zoology']; // 2336 words var seed = Math.floor(Math.random() * pow_2_32); // make more fun var log_log = HyperLogLog(0.065); for (var i = 0; i &lt; words.length; ++i) log_log.count(fnv1a(words[i]) ^ seed); var count = log_log.count(); alert(count + ', error ' + (count - words.length) / (words.length / 100.0) + '%'); </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POLogLog and HyperLogLog algorithms for counting of large cardinalities
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USactual
    1. USactual
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POLogLog and HyperLogLog algorithms for counting of large cardinalities
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COcongrats to 1k :)
      singulars
      1. PO
      1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload