Cardinality estimation, specially the case of set intersections, has been studied experimentally in Papapetrou, Siberski and Nejdl ( http://www.softnet.tuc.gr/%7Epapapetrou/publications/Bloomfilters-DAPD.pdf ) for the Bloom Filter.

Is there any such available experimental study for more parcimonious structures such as Min-Hash or HyperLogLog ?

More Fabrice Clerot's questions See All
Similar questions and discussions