Bloom filter

Known as: Bloom, Bloomier filter, Layered Bloom filters 
A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Multicast benefits data center group communications in saving network bandwidth and increasing application throughput. However… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In enterprise and data center networks, the scalability of the data plane becomes increasingly challenging as forwarding tables… (More)
  • figure 1
  • table 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Bloom Filters provide space-efficient storage of sets at the cost of a probability of false positives on membership queries. The… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper considers space-efficient data structures for storing an approximation <i>S'</i> to a set <i>S</i> such that <i>S</i… (More)
  • figure 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A Bloom Filter is a space-efficient randomized data structure allowing membership queries over sets with certain allowable errors… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Bloom filter technique of hashing finds several applications, such as in efficient maintenance of differential files, space… (More)
  • table I
  • table II
Is this relevant?
Highly Cited
1983
Highly Cited
1983
This note deals with a paper by Gremillion demonstrating the simulation approach to the design of a Bloom filter. It is shown… (More)
  • table I
Is this relevant?