Sliding bloom filters

Moni Naor; Eylon Yogev

doi:10.1007/978-3-642-45030-3_48

Sliding bloom filters

Moni Naor, Eylon Yogev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

A Bloom filter is a method for reducing the space (memory) required for representing a set by allowing a small error probability. In this paper we consider a Sliding Bloom Filter: a data structure that, given a stream of elements, supports membership queries of the set of the last n elements (a sliding window), while allowing a small error probability and a slackness parameter. The problem of sliding Bloom filters has appeared in the literature in several communities, but this work is the first theoretical investigation of it. We formally define the data structure and its relevant parameters and analyze the time and memory requirements needed to achieve them. We give a low space construction that runs in O(1) time per update with high probability (that is, for all sequences with high probability all operations take constant time) and provide an almost matching lower bound on the space that shows that our construction has the best possible space consumption up to an additive lower order term.

Original language	English
Title of host publication	Algorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings
Pages	513-523
Number of pages	11
DOIs	https://doi.org/10.1007/978-3-642-45030-3_48
State	Published - 2013
Externally published	Yes
Event	24th International Symposium on Algorithms and Computation, ISAAC 2013 - Hong Kong, China Duration: 16 Dec 2013 → 18 Dec 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8283 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	24th International Symposium on Algorithms and Computation, ISAAC 2013
Country/Territory	China
City	Hong Kong
Period	16/12/13 → 18/12/13

Bibliographical note

Funding Information:
Research supported in part by a grant from the I-CORE Program of the Planning and Budgeting Committee, the Israel Science Foundation and the Citi Foundation.

Access to Document

10.1007/978-3-642-45030-3_48

Cite this

@inproceedings{c25bd6e8f9ff44ad8d3a47c6d8d00fb9,

title = "Sliding bloom filters",

abstract = "A Bloom filter is a method for reducing the space (memory) required for representing a set by allowing a small error probability. In this paper we consider a Sliding Bloom Filter: a data structure that, given a stream of elements, supports membership queries of the set of the last n elements (a sliding window), while allowing a small error probability and a slackness parameter. The problem of sliding Bloom filters has appeared in the literature in several communities, but this work is the first theoretical investigation of it. We formally define the data structure and its relevant parameters and analyze the time and memory requirements needed to achieve them. We give a low space construction that runs in O(1) time per update with high probability (that is, for all sequences with high probability all operations take constant time) and provide an almost matching lower bound on the space that shows that our construction has the best possible space consumption up to an additive lower order term.",

author = "Moni Naor and Eylon Yogev",

note = "Funding Information: Research supported in part by a grant from the I-CORE Program of the Planning and Budgeting Committee, the Israel Science Foundation and the Citi Foundation.; 24th International Symposium on Algorithms and Computation, ISAAC 2013 ; Conference date: 16-12-2013 Through 18-12-2013",

year = "2013",

doi = "10.1007/978-3-642-45030-3_48",

language = "אנגלית",

isbn = "9783642450297",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "513--523",

booktitle = "Algorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings",

}

Naor, M & Yogev, E 2013, Sliding bloom filters. in Algorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8283 LNCS, pp. 513-523, 24th International Symposium on Algorithms and Computation, ISAAC 2013, Hong Kong, China, 16/12/13. https://doi.org/10.1007/978-3-642-45030-3_48

Sliding bloom filters. / Naor, Moni; Yogev, Eylon.
Algorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings. 2013. p. 513-523 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8283 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Sliding bloom filters

AU - Naor, Moni

AU - Yogev, Eylon

N1 - Funding Information: Research supported in part by a grant from the I-CORE Program of the Planning and Budgeting Committee, the Israel Science Foundation and the Citi Foundation.

PY - 2013

Y1 - 2013

N2 - A Bloom filter is a method for reducing the space (memory) required for representing a set by allowing a small error probability. In this paper we consider a Sliding Bloom Filter: a data structure that, given a stream of elements, supports membership queries of the set of the last n elements (a sliding window), while allowing a small error probability and a slackness parameter. The problem of sliding Bloom filters has appeared in the literature in several communities, but this work is the first theoretical investigation of it. We formally define the data structure and its relevant parameters and analyze the time and memory requirements needed to achieve them. We give a low space construction that runs in O(1) time per update with high probability (that is, for all sequences with high probability all operations take constant time) and provide an almost matching lower bound on the space that shows that our construction has the best possible space consumption up to an additive lower order term.

AB - A Bloom filter is a method for reducing the space (memory) required for representing a set by allowing a small error probability. In this paper we consider a Sliding Bloom Filter: a data structure that, given a stream of elements, supports membership queries of the set of the last n elements (a sliding window), while allowing a small error probability and a slackness parameter. The problem of sliding Bloom filters has appeared in the literature in several communities, but this work is the first theoretical investigation of it. We formally define the data structure and its relevant parameters and analyze the time and memory requirements needed to achieve them. We give a low space construction that runs in O(1) time per update with high probability (that is, for all sequences with high probability all operations take constant time) and provide an almost matching lower bound on the space that shows that our construction has the best possible space consumption up to an additive lower order term.

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

U2 - 10.1007/978-3-642-45030-3_48

DO - 10.1007/978-3-642-45030-3_48

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84893414763

SN - 9783642450297

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 513

EP - 523

BT - Algorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings

T2 - 24th International Symposium on Algorithms and Computation, ISAAC 2013

Y2 - 16 December 2013 through 18 December 2013

ER -

Sliding bloom filters

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this