An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique

DOI10.1080/09720529.2014.932129MaRDI QIDQ5069671zbMATH OpenOpenAlexFDO

Authors K. Saravanan, Amutha Senthilkumar

Publication date 19 April 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2014.932129

zbMATH Keywords

hash functionwireless sensor networksBloom filternetwork intrusion detection systemscounting Bloom filterdynamic Bloom filterfalse positive ratioparallel Bloom filterstandard Bloom filter

Mathematics Subject Classification ID

Data structures (68P05) Wireless sensor networks as related to computer science (68M18)

Cites work

• scientific article; zbMATH DE number 52019 (Why is no real title available?)
• scientific article; zbMATH DE number 6469129 (Why is no real title available?)
• An optimal bloom filter replacement
• Development of a fine-grained parallel Karhunen-Loève transform
• Network Applications of Bloom Filters: A Survey
• Optimizing data popularity conscious Bloom filters
• Principal component analysis.
• Receiver-oriented design of bloom filters for data-centric routing
• Scalable Bloom filters
• Space/time trade-offs in hash coding with allowable errors

This page was built for publication: An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069671)