Invertible Bloom Lookup Tables

Abstract

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.

contains 4 figures, showing experimental performance

References in corpus (1)

• Differential equation approximations for Markov chains

Cited by in corpus (20)

• Building Scalable Decentralized Payment Systems
• A Bloom Filter Survey: Variants for Different Domain Applications
• On Thresholds for the Appearance of 2-cores in Mixed Hypergraphs
• A New Hybrid Consensus Protocol: Deterministic Proof Of Work
• The Distributed Bloom Filter
• Approximate Distributed Joins in Apache Spark
• A survey of data transfer and storage techniques in prevalent cryptocurrencies and suggested improvements
• Byzantine Eventual Consistency and the Fundamental Limits of Peer-to-Peer Databases
• Biff (Bloom Filter) Codes : Fast Error Correction for Large Data Sets
• A Fast and Compact Invertible Sketch for Network-Wide Heavy Flow Detection
• Semi-Streaming Algorithms for Annotated Graph Streams
• Parallel Peeling Algorithms
• SHO-FA: Robust compressive sensing with order-optimal complexity, measurements, and bits
• Robust Set Reconciliation via Locality Sensitive Hashing
• Optimal Las Vegas reduction from one-way set reconciliation to error correction
• Hardness of Peeling with Stashes
• Reducing Reconciliation Communication Cost with Compressed Sensing
• Zero-CPU Collection with Direct Telemetry Access
• Energy-efficient Decoders for Compressive Sensing: Fundamental Limits and Implementations
• Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)