An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique. (4th May 2015)

• Record Type: Journal Article
• Authors: Saravanan, K.; Senthilkumar, A.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 18:Number 3(2015)
• Page Start: 247
• Page End: 263
• Publication Date: 2015-05-04
• Subjects: Bloom filter -- false positive ratio -- hash function -- standard bloom filter -- counting bloom filter -- parallel bloom filter -- dynamic bloom filter -- wireless sensor networks -- network intrusion detection systems; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2014.932129
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: Bloom filter idea was bloomed in the early seventy's as an efficient data structure tool for intelligent dictionary and spell check purposes and later revisited by the research community for its dynamic membership decision making and querying ability. Recently various optimization models for diverse applications emerged. Bloom filters are now implied in various networking applications, security applications and other emerging areas which require intensive querying and compact storage. Still it has scope for optimization and utilization. In this paper we present an insight survey on bloom filter and its variants and also discuss the applications and issues. This review will highly benefit the research community working in this field.