arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1101.2245cs.DScs.DB
收藏

Invertible Bloom可转换表

Invertible Bloom Lookup Tables

Michael T. Goodrich, Michael Mitzenmacher

摘要:

我们提出了一个版本的布隆过滤器数据结构,不仅支持插入,删除和查找的关键字-值对,但也允许一个完整的列表,其内容具有很高的概率,只要关键字-值对的数量低于设计的阈值。我们的结构允许键值对的数量在正常操作期间大大超过这个阈值。超过阈值只是暂时阻止内容列表并降低成功查找的概率。如果后来的条目被删除以返回低于阈值的结构,则一切都再次正常工作。我们还表明,我们的结构的简单的变化是强大的某些标准错误,如删除一个关键没有相应的插入或插入两个不同的值的关键。我们的结构的属性使它适合于几个应用程序,包括数据库和网络应用程序,我们强调。

英文摘要:

We present a version of the Bloom filter data structure that supports not only the insertion, deletion, and lookup of key-value pairs, but also allows a complete listing of its contents with high probability, as long the number of key-value pairs is below a designed threshold. Our structure allows the number of key-value pairs to greatly exceed this threshold during normal operation. Exceeding the threshold simply temporarily prevents content listing and reduces the probability of a successful lookup. If later entries are deleted to return the structure below the threshold, everything again functions appropriately. We also show that simple variations of our structure are robust to certain standard errors, such as the deletion of a key without a corresponding insertion or the insertion of two distinct values for a key. The properties of our structure make it suitable for several applications, including database and networking applications that we highlight.

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

↑