lsd0003

LSD0003: Set Union
Log | Files | Refs | README

commit 5b68667dc8e9e04b0aa01e46879920414afb7213
parent 89611d24a36b0c77c9f62b7a9b77432000569800
Author: Elias Summermatter <elias.summermatter@seccom.ch>
Date:   Mon, 21 Dec 2020 12:13:36 +0100

Added some improvments strata descriptioN

Diffstat:
Mdraft-summermatter-set-union.xml | 13++++++++-----
1 file changed, 8 insertions(+), 5 deletions(-)

diff --git a/draft-summermatter-set-union.xml b/draft-summermatter-set-union.xml @@ -371,11 +371,14 @@ <t> The trick is to decode the SE with the biggest stratum first and calculate the difference of the set if the SE decodes successfully decode the next smaller strata estimator repeat - this until the decoding of the SE fails or Stratum 0 is reached. Then its possible to estimate ### Wie berechne ich den strata estimator Decodieren wie ist die formal um die - how big the difference between two sets is by calculating the count of ### 2^n*k k=elemente (Durchnitt duch alle die estimatoren) Systamatischer pyas - ### Wie ist die formel sein? - decoded elements divided by the stratum factor. If no of the SE decoded choose a smaller stratum or - try a other hash function. + this until the decoding of the SE fails or Stratum 0 is reached. Then its possible to estimate + how big the difference between two sets is by adding the number of extracted hashes up (C) and scale it + by the expected number of elements (E) in the remaining unencoded IBF's (C*E=[estimated count of objects]). + If no of the SE decoded choose a smaller stratum or try a other hash function. + + ### Wie berechne ich den strata estimator Decodieren wie ist die formal um die + ### 2^n*k k=elemente (Durchnitt duch alle die estimatoren) Systamatischer pyas + ### Wie ist die formel sein? </t> </section> </section>