www-ai.cs.tu-dortmund.de/LEHRE/FACHPROJEKT/SS12/paper/counting/Arasu2004.pdf
collection of sketches:
{F2k , ε
2 (m+1,N +1),F2k−1, ε
2 (m+1, 2k−1), . . . ,F 2
ε , ε
2
(m+1, 2
ε )}
Further, if N+1 = 2k, we construct F2k+1, ε
2 (m+1, 2k) from
F2k , ε
2 (m+1, 2k) and add it to the collection [...] lection of the following blog2 εNc bounded-window sketches, where k is the integer satisfying 2k−1 ≤ N < 2k:
{F2k , ε
2 (m,N),F2k−1, ε
2 (m, 2k−1), . . . ,F 2
ε , ε
2 (m,
2
ε )}
The three basic operations [...] sketch F2k , ε
2 (m, N). All other
sketches remain unchanged. This results in the collection of sketches:
{F2k , ε
2 (m, N − 1),F2k−1, ε
2 (m, 2k−1), . . . ,F 2
ε , ε
2 (m,
2
ε )}
Further, if N−1 < 2k−1, we …
