Bloom Filters、Adaptability和Dictionary Problem
Bloom Filters, Adaptivity, and the Dictionary Problem
摘要:
Bloom过滤器--或者更一般地说,近似成员查询数据结构(AMQ)--维护来自宇宙U的一组密钥S的紧凑、概率表示。AMQ支持查找、插入和(对于某些AMQ)删除。对S中的x的查询保证返回“present”。对不在S中的x的查询返回“不存在”,概率至少为1- 1/2,其中1/2是可调的假阳性概率。如果查询返回“present”,但x不在S中,则x是AMQ的误报。由于AMQ具有非零的假阳性概率,它们需要的空间比显式集合表示少得多。AMQ被广泛用于加速远程存储的字典(例如,在磁盘上/通过网络)。大多数AMQ对它们将在一系列查询中返回的误报数量提供弱保证。假阳性概率仅对单个查询有效。攻击者很容易通过简单地重复误报来将AMQ的误报率推向1。本文展示了如何在误报数量上获得强有力的保证。我们说AMQ是自适应的,如果它保证了每个查询的误报概率,而不管以前的查询的答案。首先,我们证明了建立一个小的自适应AMQ是不可能的,即使AMQ在返回假阳性时立即被告知。然后,我们将展示如何构建一个自适应AMQ,将其状态划分为一个小的本地组件和一个较大的远程组件。除了自适应,我们的AMQ的本地组件在所有方面都主导现有的AMQ。它使用最优空间直到低阶术语,并支持在最坏情况下的恒定时间内以高概率进行查询和更新。因此,我们表明,自适应没有成本。
英文摘要:
The Bloom filter---or, more generally, an approximate membership query data structure (AMQ)---maintains a compact, probabilistic representation of a set S of keys from a universe U. An AMQ supports lookups, inserts, and (for some AMQs) deletes. A query for an x in S is guaranteed to return "present." A query for x not in S returns "absent" with probability at least 1-epsilon, where epsilon is a tunable false positive probability. If a query returns "present," but x is not in S, then x is a false positive of the AMQ. Because AMQs have a nonzero probability of false-positives, they require far less space than explicit set representations. AMQs are widely used to speed up dictionaries that are stored remotely (e.g., on disk/across a network). Most AMQs offer weak guarantees on the number of false positives they will return on a sequence of queries. The false-positive probability of epsilon holds only for a single query. It is easy for an adversary to drive an AMQ's false-positive rate towards 1 by simply repeating false positives. This paper shows what it takes to get strong guarantees on the number of false positives. We say that an AMQs is adaptive if it guarantees a false-positive probability of epsilon for every query, regardless of answers to previous queries. First, we prove that it is impossible to build a small adaptive AMQ, even when the AMQ is immediately told whenever it returns a false positive. We then show how to build an adaptive AMQ that partitions its state into a small local component and a larger remote component. In addition to being adaptive, the local component of our AMQ dominates existing AMQs in all regards. It uses optimal space up to lower-order terms and supports queries and updates in worst-case constant time, with high probability. Thus, we show that adaptivity has no cost.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。