arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.5872cs.DS
收藏

滑动Bloom过滤器

Sliding Bloom Filters

Moni Naor, Eylon Yogev

摘要:

布隆过滤器是一种通过允许小的错误概率来减少表示集合所需的空间(存储器)的方法。在本文中,我们考虑一个\emph{Sliding Bloom Filter}:一个数据结构,给定的元素流,支持成员查询的最后$n$元素(滑动窗口)的集合,同时允许一个小的错误概率。我们正式定义了数据结构及其相关参数,并分析了实现它们所需的时间和内存要求。我们给出了一个低空间结构,运行在O(1)时间每次更新的高概率(也就是说,对于所有序列的高概率所有操作都需要恒定的时间),并提供了一个几乎匹配的空间上的下界,表明我们的建设有最好的空间消耗添加剂低阶项。

英文摘要:

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 \emph{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. 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑