NIST · ИТ · 9ce22a2c827f218b7b83
A Two-Tier Bloom Filter to Achieve Faster Membership Testing
Testing for element membership in a Bloom Filter requires hashing of a test element (e.g., a string) and multiple look-ups in memory. A design of a new two-tier Bloom filter with on-chip hash functions and cache is described. For elements with a heavy
NIST · ИТОфициальный источник · 2008-03-27
{
"title_en": "A Two-Tier Bloom Filter to Achieve Faster Membership Testing",
"designation": "",
"series": "",
"status": "",
"date": "2008-03-27",
"date_original": "March 27, 2008",
"url": "https://www.nist.gov/publications/two-tier-bloom-filter-achieve-faster-membership-testing",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Miguel Jimeno, K Christensen, Allen L. Roginsky",
"abstract_excerpt_en": "Testing for element membership in a Bloom Filter requires hashing of a test element (e.g., a string) and multiple look-ups in memory. A design of a new two-tier Bloom filter with on-chip hash functions and cache is described. For elements with a heavy",
"id": "9ce22a2c827f218b7b83",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "A Two-Tier Bloom Filter to Achieve Faster Membership Testing",
"designation": "",
"series": "",
"status": "",
"date": "2008-03-27",
"date_original": "March 27, 2008",
"url": "https://www.nist.gov/publications/two-tier-bloom-filter-achieve-faster-membership-testing",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Miguel Jimeno, K Christensen, Allen L. Roginsky",
"abstract_excerpt_en": "Testing for element membership in a Bloom Filter requires hashing of a test element (e.g., a string) and multiple look-ups in memory. A design of a new two-tier Bloom filter with on-chip hash functions and cache is described. For elements with a heavy"
}
],
"translation_state": "none"
}