Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,355,000 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.
2016
2016
An Efficient DDoS Detection with Bloom Filter in SDN
Peng Xiao
,
Zhiyang Li
,
Heng Qi
,
W. Qu
,
Haisheng Yu
IEEE Trustcom/BigDataSE/ISPA
2016
Corpus ID: 28507177
Distributed Denial of Service (DDoS) attacks are becoming one of the major threats in the distributed data center networks which…
Expand
Highly Cited
2013
Highly Cited
2013
Robust Bloom Filters for Large MultiLabel Classification Tasks
Moustapha Cissé
,
Nicolas Usunier
,
T. Artières
,
P. Gallinari
Neural Information Processing Systems
2013
Corpus ID: 5638088
This paper presents an approach to multilabel classification (MLC) with a large number of labels. Our approach is a reduction to…
Expand
Highly Cited
2011
Highly Cited
2011
BloomFlash: Bloom Filter on Flash-Based Storage
Biplob K. Debnath
,
S. Sengupta
,
Jin Li
,
D. Lilja
,
D. Du
IEEE International Conference on Distributed…
2011
Corpus ID: 3006236
The bloom filter is a probabilistic data structure that provides a compact representation of a set of elements. To keep false…
Expand
Highly Cited
2011
Highly Cited
2011
Hot data identification for flash-based storage systems using multiple bloom filters
Dongchul Park
,
D. Du
IEEE Conference on Mass Storage Systems and…
2011
Corpus ID: 2751886
Hot data identification can be applied to a variety of fields. Particularly in flash memory, it has a critical impact on its…
Expand
Highly Cited
2010
Highly Cited
2010
The Dynamic Bloom Filters
Deke Guo
,
Jie Wu
,
Honghui Chen
,
Ye Yuan
,
Xueshan Luo
IEEE Transactions on Knowledge and Data…
2010
Corpus ID: 2271804
A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate…
Expand
Highly Cited
2007
Highly Cited
2007
Cache-, hash-, and space-efficient bloom filters
F. Putze
,
P. Sanders
,
J. Singler
JEAL
2007
Corpus ID: 187572
A Bloom filter is a very compact data structure that supports approximate membership queries on a set, allowing false positives…
Expand
Highly Cited
2006
Highly Cited
2006
Weighted Bloom filter
Jehoshua Bruck
,
Jie Gao
,
Anxiao Jiang
IEEE International Symposium on Information…
2006
Corpus ID: 1148113
A Bloom filter is a simple randomized data structure that answers membership query with no false negative and a small false…
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
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
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
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