Next Article in Journal
Pedestrian Detection with Lidar Point Clouds Based on Single Template Matching
Previous Article in Journal
Artificial Intelligence-Based Discontinuous Reception for Energy Saving in 5G Networks
Article Menu

Export Article

Open AccessArticle

Analysis of Counting Bloom Filters Used for Count Thresholding

Department of Electrical Engineering, Pohang University of Science and Technology (POSTECH), Pohang 37673, Korea
*
Author to whom correspondence should be addressed.
Electronics 2019, 8(7), 779; https://doi.org/10.3390/electronics8070779
Received: 7 June 2019 / Revised: 7 July 2019 / Accepted: 9 July 2019 / Published: 11 July 2019
(This article belongs to the Section Computer Science & Engineering)
  |  
PDF [664 KB, uploaded 15 July 2019]
  |  

Abstract

A bloom filter is an extremely useful tool applicable to various fields of electronics and computers; it enables highly efficient search of extremely large data sets with no false negatives but a possibly small number of false positives. A counting bloom filter is a variant of a bloom filter that is typically used to permit deletions as well as additions of elements to a target data set. However, it is also sometimes useful to use a counting bloom filter as an approximate counting mechanism that can be used, for example, to determine when a specific web page has been referenced more than a specific number of times or when a memory address is a “hot” address. This paper derives, for the first time, highly accurate approximate false positive probabilities and optimal numbers of hash functions for counting bloom filters used in count thresholding applications. The analysis is confirmed by comparisons to existing theoretical results, which show an error, with respect to exact analysis, of less than 0.48% for typical parameter values. View Full-Text
Keywords: counting bloom filter; database search; count thresholding; hash function counting bloom filter; database search; count thresholding; hash function
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Kim, K.; Jeong, Y.; Lee, Y.; Lee, S. Analysis of Counting Bloom Filters Used for Count Thresholding. Electronics 2019, 8, 779.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Electronics EISSN 2079-9292 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top