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

DOI10.1080/09720529.2014.932129zbMATH Open1487.68085OpenAlexW613282900MaRDI QIDQ5069671FDOQ5069671

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

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

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)