NDLI: False Negative Problem of Counting Bloom Filter

Content Provider	IEEE Xplore Digital Library
Author	Deke Guo Yunhao Liu Xiangyang Li Panlong Yang
Copyright Year	1989
Abstract	Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often believe that it is possible that a Bloom filter returns a false positive, but it will never return a false negative under well-behaved operations. By investigating the mainstream variants, however, we observe that a Bloom filter does return false negatives in many scenarios. In this work, we show that the undetectable incorrect deletion of false positive items and detectable incorrect deletion of multiaddress items are two general causes of false negative in a Bloom filter. We then measure the potential and exposed false negatives theoretically and practically. Inspired by the fact that the potential false negatives are usually not fully exposed, we propose a novel Bloom filter scheme, which increases the ratio of bits set to a value larger than one without decreasing the ratio of bits set to zero. Mathematical analysis and comprehensive experiments show that this design can reduce the number of exposed false negatives as well as decrease the likelihood of false positives. To the best of our knowledge, this is the first work dealing with both the false positive and false negative problems of Bloom filter systematically when supporting standard usages of item insertion, query, and deletion operations.
Sponsorship	IEEE IEEE Comput. Soc. Tech. Committee on Data Eng IEEE Computer Society
Starting Page	651
Ending Page	664
Page Count	14
File Size	2941339
File Format	PDF
ISSN	10414347
Volume Number	22
Issue Number	5
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-05-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Filters Data structures Mathematical analysis Tree data structures Binary search trees Databases Routing Bayesian methods multichoice counting Bloom filter. Bloom filter false negative
Content Type	Text
Resource Type	Article
Subject	Information Systems Computational Theory and Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

False negative problem of counting Bloom filter

Parallel construction of multidimensional binary search trees

False Negative Problem of Counting Bloom Filter

False negative problem of counting bloom filter.

Adaptive structuring of binary search trees using conditional rotations

Multidimensional balanced binary trees

Improving distributed join efficiency with extended bloom filter operations

A Comment on “Fast Bloom Filters and Their Generalization”

The Dynamic Bloom Filters

False Negative Problem of Counting Bloom Filter

Similar Documents

False negative problem of counting Bloom filter

Parallel construction of multidimensional binary search trees

False Negative Problem of Counting Bloom Filter

False negative problem of counting bloom filter.

Adaptive structuring of binary search trees using conditional rotations

Multidimensional balanced binary trees

Improving distributed join efficiency with extended bloom filter operations

A Comment on “Fast Bloom Filters and Their Generalization”

The Dynamic Bloom Filters

False Negative Problem of Counting Bloom Filter