4ef8344705f55276f549 · A New Analysis of the False-Positive Rate of a Bloom Filter
A New Analysis of the False-Positive Rate of a Bloom Filter
A Bloom filter is a space-efficient data structure used for probabilistic set membership testing. When testing an object for set membership, a Bloom filter may give a false positive. The analysis of the false positive rate is key to understanding the Bloom
{
"title_en": "A New Analysis of the False-Positive Rate of a Bloom Filter",
"designation": "",
"series": "",
"status": "",
"date": "2010-10-15",
"date_original": "October 15, 2010",
"url": "https://www.nist.gov/publications/new-analysis-false-positive-rate-bloom-filter",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Ken Christensen, Allen L. Roginsky , Miguel Jimeno",
"abstract_excerpt_en": "A Bloom filter is a space-efficient data structure used for probabilistic set membership testing. When testing an object for set membership, a Bloom filter may give a false positive. The analysis of the false positive rate is key to understanding the Bloom",
"id": "4ef8344705f55276f549",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "A New Analysis of the False-Positive Rate of a Bloom Filter",
"designation": "",
"series": "",
"status": "",
"date": "2010-10-15",
"date_original": "October 15, 2010",
"url": "https://www.nist.gov/publications/new-analysis-false-positive-rate-bloom-filter",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Ken Christensen, Allen L. Roginsky , Miguel Jimeno",
"abstract_excerpt_en": "A Bloom filter is a space-efficient data structure used for probabilistic set membership testing. When testing an object for set membership, a Bloom filter may give a false positive. The analysis of the false positive rate is key to understanding the Bloom"
}
],
"translation_state": "none"
}