Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,273,769 papers from all fields of science
Search
Sign In
Create Free Account
Bloom filter
Known as:
Bloom
, Bloomier filter
, Layered Bloom filters
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
46 relations
Aggregate function
Algorithm
Apache Cassandra
Apache HBase
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Cuckoo Filter: Practically Better Than Bloom
Bin Fan
,
D. Andersen
,
M. Kaminsky
,
M. Mitzenmacher
Conference on Emerging Network Experiment and…
2014
Corpus ID: 88071
In many networking systems, Bloom filters are used for high-speed set membership tests. They permit a small fraction of false…
Expand
Highly Cited
2006
Highly Cited
2006
Less hashing, same performance: Building a better Bloom filter
Adam Kirsch
,
M. Mitzenmacher
Random Struct. Algorithms
2006
Corpus ID: 2754699
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash…
Expand
Highly Cited
2006
Highly Cited
2006
An Improved Construction for Counting Bloom Filters
F. Bonomi
,
M. Mitzenmacher
,
R. Panigrahy
,
Sushil Singh
,
G. Varghese
Embedded Systems and Applications
2006
Corpus ID: 16602678
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be…
Expand
Highly Cited
2005
Highly Cited
2005
An optimal Bloom filter replacement
Anna Pagh
,
R. Pagh
,
S. Rao
ACM-SIAM Symposium on Discrete Algorithms
2005
Corpus ID: 5507317
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…
Expand
Highly Cited
2005
Highly Cited
2005
Fast hash table lookup using extended bloom filter: an aid to network processing
Haoyu Song
,
Sarang Dharmapurikar
,
J. Turner
,
J. Lockwood
Conference on Applications, Technologies…
2005
Corpus ID: 1761842
Hash tables are fundamental components of several network processing algorithms and applications, including route lookup, packet…
Expand
Review
2004
Review
2004
Network Applications of Bloom Filters: A Survey
A. Broder
,
M. Mitzenmacher
Internet Mathematics
2004
Corpus ID: 1560675
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership…
Expand
Highly Cited
2004
Highly Cited
2004
Deep packet inspection using parallel bloom filters
Sarang Dharmapurikar
,
P. Krishnamurthy
,
T. Sproull
,
J. Lockwood
IEEE Micro
2004
Corpus ID: 5632356
There is a class of packet processing applications that inspect packets deeper than the protocol headers to analyze content. For…
Expand
Highly Cited
2003
Highly Cited
2003
Spectral bloom filters
Saar Cohen
,
Yossi Matias
ACM SIGMOD Conference
2003
Corpus ID: 1058187
A Bloom Filter is a space-efficient randomized data structure allowing membership queries over sets with certain allowable errors…
Expand
Highly Cited
2003
Highly Cited
2003
Longest prefix matching using bloom filters
Sarang Dharmapurikar
,
P. Krishnamurthy
,
David E. Taylor
IEEE/ACM Transactions on Networking
2003
Corpus ID: 2839865
We introduce the first algorithm that we are aware of to employ Bloom filters for longest prefix matching (LPM). The algorithm…
Expand
Highly Cited
2001
Highly Cited
2001
Compressed bloom filters
M. Mitzenmacher
ACM SIGACT-SIGOPS Symposium on Principles of…
2001
Corpus ID: 2251932
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE