Irregular Invertible Bloom Look-Up Tables
Francisco L\'azaro, Bal\'azs Matuz

TL;DR
This paper introduces a generalized density evolution analysis for irregular invertible Bloom lookup tables (IBLTs), enabling prediction of their capacity and demonstrating improved performance over existing designs through simulations.
Contribution
It provides a novel density evolution framework for irregular IBLTs, extending previous results and optimizing their key-value recovery capabilities.
Findings
Predicts maximum insertable key-value pairs with high probability
Generalizes analysis to arbitrary irregular degree distributions
Shows improved recovery performance in simulations
Abstract
We consider invertible Bloom lookup tables (IBLTs) which are probabilistic data structures that allow to store keyvalue pairs. An IBLT supports insertion and deletion of key-value pairs, as well as the recovery of all key-value pairs that have been inserted, as long as the number of key-value pairs stored in the IBLT does not exceed a certain number. The recovery operation on an IBLT can be represented as a peeling process on a bipartite graph. We present a density evolution analysis of IBLTs which allows to predict the maximum number of key-value pairs that can be inserted in the table so that recovery is still successful with high probability. This analysis holds for arbitrary irregular degree distributions and generalizes results in the literature. We complement our analysis by numerical simulations of our own IBLT design which allows to recover a larger number of key-value pairs as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
