Bloom Filters: A Review

Arulanand Natarajan, K. Premalatha, S. Subramanian

Abstract


This paper presents different representations and applications of Bloom filter. A Bloom filter is a simple but powerful data structure
that can check membership to a static set. Bloom filters become more popular for networking system applications, spell-checkers, string matching
algorithms, network packet analysis tools and network/internet caches and database optimization. This paper will examine and analyze different
types of bloom filter and its applications.

 

Keywords: Bloom Filter, Data Structure, Counting Bloom Filter, Dynamic Bloom Filter, Anomaly Detection


Full Text:

PDF


DOI: https://doi.org/10.26483/ijarcs.v1i3.98

Refbacks

  • There are currently no refbacks.




Copyright (c) 2016 International Journal of Advanced Research in Computer Science