Bloom Filter with a False Positive Free Zone

Sandor Z. Kiss, Eva Hosszu, J. Tapolcai, L. Rónyai, Ori Rottenstreich

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Bloom filters and their variants are widely used as space efficient probabilistic data structures for representing set systems and are very popular in networking applications. They support fast element insertion and deletion, along with membership queries with the drawback of false positives. Bloom filters can be designed to match the false positive rates that are acceptable for the application domain. However, in many applications a common engineering solution is to set the false positive rate very small, and ignore the existence of the very unlikely false positive answers. This paper is devoted to close the gap between the two design concepts of unlikely and not having false positives. We propose a data structure, called EGH filter, that supports the Bloom filter operations and besides it can guarantee false positive free operations for a finite universe and a restricted number of elements stored in the filter. We refer to the limited universe and filter size as the false positive free zone of the filter. We describe necessary conditions for the false positive free zone of a filter and generalize the filter to support listing of the elements. We evaluate the performance of the filter in comparison with the traditional Bloom filters. Our data structure is based on recently developed combinatorial group testing techniques.

Original languageEnglish
Title of host publicationINFOCOM 2018 - IEEE Conference on Computer Communications
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1412-1420
Number of pages9
Volume2018-April
ISBN (Electronic)9781538641286
DOIs
Publication statusPublished - Oct 8 2018
Event2018 IEEE Conference on Computer Communications, INFOCOM 2018 - Honolulu, United States
Duration: Apr 15 2018Apr 19 2018

Other

Other2018 IEEE Conference on Computer Communications, INFOCOM 2018
CountryUnited States
CityHonolulu
Period4/15/184/19/18

Fingerprint

Data structures
Testing

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Kiss, S. Z., Hosszu, E., Tapolcai, J., Rónyai, L., & Rottenstreich, O. (2018). Bloom Filter with a False Positive Free Zone. In INFOCOM 2018 - IEEE Conference on Computer Communications (Vol. 2018-April, pp. 1412-1420). [8486415] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFOCOM.2018.8486415

Bloom Filter with a False Positive Free Zone. / Kiss, Sandor Z.; Hosszu, Eva; Tapolcai, J.; Rónyai, L.; Rottenstreich, Ori.

INFOCOM 2018 - IEEE Conference on Computer Communications. Vol. 2018-April Institute of Electrical and Electronics Engineers Inc., 2018. p. 1412-1420 8486415.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kiss, SZ, Hosszu, E, Tapolcai, J, Rónyai, L & Rottenstreich, O 2018, Bloom Filter with a False Positive Free Zone. in INFOCOM 2018 - IEEE Conference on Computer Communications. vol. 2018-April, 8486415, Institute of Electrical and Electronics Engineers Inc., pp. 1412-1420, 2018 IEEE Conference on Computer Communications, INFOCOM 2018, Honolulu, United States, 4/15/18. https://doi.org/10.1109/INFOCOM.2018.8486415
Kiss SZ, Hosszu E, Tapolcai J, Rónyai L, Rottenstreich O. Bloom Filter with a False Positive Free Zone. In INFOCOM 2018 - IEEE Conference on Computer Communications. Vol. 2018-April. Institute of Electrical and Electronics Engineers Inc. 2018. p. 1412-1420. 8486415 https://doi.org/10.1109/INFOCOM.2018.8486415
Kiss, Sandor Z. ; Hosszu, Eva ; Tapolcai, J. ; Rónyai, L. ; Rottenstreich, Ori. / Bloom Filter with a False Positive Free Zone. INFOCOM 2018 - IEEE Conference on Computer Communications. Vol. 2018-April Institute of Electrical and Electronics Engineers Inc., 2018. pp. 1412-1420
@inproceedings{d8d1cca7ea414b7097ea591b15914537,
title = "Bloom Filter with a False Positive Free Zone",
abstract = "Bloom filters and their variants are widely used as space efficient probabilistic data structures for representing set systems and are very popular in networking applications. They support fast element insertion and deletion, along with membership queries with the drawback of false positives. Bloom filters can be designed to match the false positive rates that are acceptable for the application domain. However, in many applications a common engineering solution is to set the false positive rate very small, and ignore the existence of the very unlikely false positive answers. This paper is devoted to close the gap between the two design concepts of unlikely and not having false positives. We propose a data structure, called EGH filter, that supports the Bloom filter operations and besides it can guarantee false positive free operations for a finite universe and a restricted number of elements stored in the filter. We refer to the limited universe and filter size as the false positive free zone of the filter. We describe necessary conditions for the false positive free zone of a filter and generalize the filter to support listing of the elements. We evaluate the performance of the filter in comparison with the traditional Bloom filters. Our data structure is based on recently developed combinatorial group testing techniques.",
author = "Kiss, {Sandor Z.} and Eva Hosszu and J. Tapolcai and L. R{\'o}nyai and Ori Rottenstreich",
year = "2018",
month = "10",
day = "8",
doi = "10.1109/INFOCOM.2018.8486415",
language = "English",
volume = "2018-April",
pages = "1412--1420",
booktitle = "INFOCOM 2018 - IEEE Conference on Computer Communications",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Bloom Filter with a False Positive Free Zone

AU - Kiss, Sandor Z.

AU - Hosszu, Eva

AU - Tapolcai, J.

AU - Rónyai, L.

AU - Rottenstreich, Ori

PY - 2018/10/8

Y1 - 2018/10/8

N2 - Bloom filters and their variants are widely used as space efficient probabilistic data structures for representing set systems and are very popular in networking applications. They support fast element insertion and deletion, along with membership queries with the drawback of false positives. Bloom filters can be designed to match the false positive rates that are acceptable for the application domain. However, in many applications a common engineering solution is to set the false positive rate very small, and ignore the existence of the very unlikely false positive answers. This paper is devoted to close the gap between the two design concepts of unlikely and not having false positives. We propose a data structure, called EGH filter, that supports the Bloom filter operations and besides it can guarantee false positive free operations for a finite universe and a restricted number of elements stored in the filter. We refer to the limited universe and filter size as the false positive free zone of the filter. We describe necessary conditions for the false positive free zone of a filter and generalize the filter to support listing of the elements. We evaluate the performance of the filter in comparison with the traditional Bloom filters. Our data structure is based on recently developed combinatorial group testing techniques.

AB - Bloom filters and their variants are widely used as space efficient probabilistic data structures for representing set systems and are very popular in networking applications. They support fast element insertion and deletion, along with membership queries with the drawback of false positives. Bloom filters can be designed to match the false positive rates that are acceptable for the application domain. However, in many applications a common engineering solution is to set the false positive rate very small, and ignore the existence of the very unlikely false positive answers. This paper is devoted to close the gap between the two design concepts of unlikely and not having false positives. We propose a data structure, called EGH filter, that supports the Bloom filter operations and besides it can guarantee false positive free operations for a finite universe and a restricted number of elements stored in the filter. We refer to the limited universe and filter size as the false positive free zone of the filter. We describe necessary conditions for the false positive free zone of a filter and generalize the filter to support listing of the elements. We evaluate the performance of the filter in comparison with the traditional Bloom filters. Our data structure is based on recently developed combinatorial group testing techniques.

UR - http://www.scopus.com/inward/record.url?scp=85056173677&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85056173677&partnerID=8YFLogxK

U2 - 10.1109/INFOCOM.2018.8486415

DO - 10.1109/INFOCOM.2018.8486415

M3 - Conference contribution

AN - SCOPUS:85056173677

VL - 2018-April

SP - 1412

EP - 1420

BT - INFOCOM 2018 - IEEE Conference on Computer Communications

PB - Institute of Electrical and Electronics Engineers Inc.

ER -