Computationally efficient index generation unit using a Bloom filter

Tomasz Mazurkiewicz

doi:10.1117/12.2534641

6 November 2019 Computationally efficient index generation unit using a Bloom filter

Tomasz Mazurkiewicz

Proceedings Volume 11176, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2019; 111761L (2019) https://doi.org/10.1117/12.2534641
Event: Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2019, 2019, Wilga, Poland

Abstract

Efficient implementation of index generation functions is attracting significant interest due to the dynamic development of technologies such as Big Data and Internet of Things. These functions can be realized using a circuit called index generation unit. However, the better linear transformation of an index generation function is found, the larger auxiliary memory is used. Lately, the architecture that uses probabilistic data structure was proposed. However, it requires several independent hash functions. Selecting proper hash functions is a complex issue. Thus, in this paper we analyse a structure that uses single hash function, i.e. One-Hashing Bloom Filter. It requires additional modulo stage to compute several independent hashes. However, the obtained results prove that additional computations, can be easily implemented in FPGA devices.

Citation Download Citation

Tomasz Mazurkiewicz "Computationally efficient index generation unit using a Bloom filter", Proc. SPIE 11176, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2019, 111761L (6 November 2019); https://doi.org/10.1117/12.2534641

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available