An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique
From MaRDI portal
Publication:5069671
DOI10.1080/09720529.2014.932129zbMath1487.68085OpenAlexW613282900MaRDI QIDQ5069671
Amutha Senthilkumar, K. Saravanan
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
wireless sensor networksBloom filterhash functionnetwork intrusion detection systemscounting Bloom filterdynamic Bloom filterfalse positive ratioparallel Bloom filterstandard Bloom filter
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scalable Bloom filters
- Principal component analysis.
- Development of a fine-grained parallel Karhunen-Loève transform
- Receiver-oriented design of bloom filters for data-centric routing
- Optimizing data popularity conscious bloom filters
- Network Applications of Bloom Filters: A Survey
- 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