Understanding bloom filter intersection for lazy address-set disambiguation
MC Jeffrey, JG Steffan - Proceedings of the twenty-third annual ACM …, 2011 - dl.acm.org
A Bloom filter is a probabilistic bit-array-based set representation that has recently been
applied to address-set disambiguation in systems that ease the burden of parallel
programming. However, many of these systems intersect the Bloom filter bit-arrays to
approximate address-set intersection and decide set disjointness. This is in contrast with the
conventional and well-studied approach of making individual membership queries into the
Bloom filter. In this paper we present much-needed probabilistic models for the …
applied to address-set disambiguation in systems that ease the burden of parallel
programming. However, many of these systems intersect the Bloom filter bit-arrays to
approximate address-set intersection and decide set disjointness. This is in contrast with the
conventional and well-studied approach of making individual membership queries into the
Bloom filter. In this paper we present much-needed probabilistic models for the …
[CITATION][C] Understanding bloom filter intersection for lazy address-set disambiguation
CJ Mark, JG Stean - Proceedings of the 23rd ACM symposium on …
Showing the best results for this search. See all results