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

伸缩滤波器:一种实用的自适应滤波器

Telescoping Filter: A Practical Adaptive Filter

David J. Lee, Samuel McCauley, Shikha Singh, Max Stein

摘要:

过滤器是快速、小型和近似的集成员数据结构。它们通常用于过滤掉对远程集合S的否定查询(即不在S中的查询x)的昂贵访问。过滤器有单侧错误:在否定查询中,过滤器可能会说“存在”,并具有可调的假阳性概率。正确性是用空间来交换的:过滤器每个元素只使用log(1/ε)+ O(1)位。然而,大多数过滤器的假阳性保证仅适用于单个查询。特别地,如果x是过滤器的假阳性,则对x的后续查询是概率为1的假阳性,而不是1。考虑到这一点,最近的工作已经引入了自适应滤波器的概念。过滤器是自适应的,如果每个查询都有假阳性,不管过去做了什么查询。这需要在出现误报时“修复”误报。自适应过滤器不仅在对抗环境中提供强大的误报保证,而且通过消除重复误报来提高查询实际工作负载的性能。自适应滤波器的现有工作分为两类。首先,有一些基于布谷鸟过滤器的实用过滤器,它们试图在不满足自适应保证的情况下修复误报。同时,扫帚滤波器是一个非常复杂的自适应滤波器,满足最佳的理论界。在本文中,我们弥合这一差距,设计一个实用的,可证明的自适应滤波器:伸缩自适应滤波器。我们提供了我们的过滤器的理论误报和空间保证,以及经验结果,我们比较其误报性能对国家的最先进的过滤器。我们还测试了我们的过滤器的吞吐量,显示它们实现类似的非自适应过滤器的性能。

英文摘要:

Filters are fast, small and approximate set membership data structures. They are often used to filter out expensive accesses to a remote set S for negative queries (that is, a query x not in S). Filters have one-sided errors: on a negative query, a filter may say "present" with a tunable false-positve probability of epsilon. Correctness is traded for space: filters only use log (1/ε) + O(1) bits per element. The false-positive guarantees of most filters, however, hold only for a single query. In particular, if x is a false positive of a filter, a subsequent query to x is a false positive with probability 1, not epsilon. With this in mind, recent work has introduced the notion of an adaptive filter. A filter is adaptive if each query has false positive epsilon, regardless of what queries were made in the past. This requires "fixing" false positives as they occur. Adaptive filters not only provide strong false positive guarantees in adversarial environments but also improve performance on query practical workloads by eliminating repeated false positives. Existing work on adaptive filters falls into two categories. First, there are practical filters based on cuckoo filters that attempt to fix false positives heuristically, without meeting the adaptivity guarantee. Meanwhile, the broom filter is a very complex adaptive filter that meets the optimal theoretical bounds. In this paper, we bridge this gap by designing a practical, provably adaptive filter: the telescoping adaptive filter. We provide theoretical false-positive and space guarantees of our filter, along with empirical results where we compare its false positive performance against state-of-the-art filters. We also test the throughput of our filters, showing that they achieve comparable performance to similar non-adaptive filters.

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

↑