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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.