NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

A Two-Tier Bloom Filter to Achieve Faster Membership Testing

Published

Author(s)

Miguel Jimeno, K Christensen, Allen L. Roginsky

Abstract

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-tailed distribution for popularity, membership testing time can be significantly reduced.
Citation
IEEE Electronics Letters
Volume
44
Pub Type
Journals

Download Paper

Local Download

Keywords

Bloom filter, caching, probability distributions
Cybersecurity and privacy

Citation

Jimeno, M. , Christensen, K. and Roginsky, A. (2008), A Two-Tier Bloom Filter to Achieve Faster Membership Testing, IEEE Electronics Letters, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=51317 (Accessed October 10, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created March 26, 2008, Updated October 12, 2021
Was this page helpful?