In this paper, the author seems to suggest that theta sketches(a variant of kmv) outperforms hyperloglog in cardinality estimation on the intersection of n way streams.
Set Intersection. multiKMV can be tweaked in a natural way to handle set intersection and other set operations.
I am having a hard time understanding how intersection on kmv set can perform intersection accurately
The way I understand it, KMV can be describe by the following
Given a stream of number $x = [x_1, .... x_n]$ if we hash each number in $x$ and produce $h = [hash(x_1).....hash(x_n)]$
KMV attempts to represents and capture the characteristic of the stream by storing $k$ minimum value of $h$
The intersection of 2 streams is basically the naive intersection of 2 kmv set.
However this can't be true because if its true the operation is lossy, and probably cannot sustain more than a couple intersection without loosing its accuracy on estimating cardinality.
Can someone point me a direction on how kmv achieve accurate cardinality estimation of 2 or more streams?