Irregular Invertible Bloom Look-Up Tables

07/06/2021
by   Francisco Lázaro, et al.
0

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 state-of-the-art IBLTs of same size.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2022

A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables

Lua (Ierusalimschy et al., 1996) is a well-known scripting language, pop...
research
11/08/2021

Sequence pairs related to produced graphs from a method for dividing a natural number by two

This paper is about producing a new kind of the pairs which we call it M...
research
03/26/2018

Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays

Many succinct data structures on the word RAM require precomputed tables...
research
08/16/2021

Efficient Network Analysis Under Single Link Deletion

The problem of worst case edge deletion from a network is considered. Su...
research
06/04/2018

On Computing the Multiplicity of Cycles in Bipartite Graphs Using the Degree Distribution and the Spectrum of the Graph

Counting short cycles in bipartite graphs is a fundamental problem of in...
research
12/28/2022

Invertible Bloom Lookup Tables with Listing Guarantees

The Invertible Bloom Lookup Table (IBLT) is a probabilistic concise data...
research
07/14/2023

Towards Model-Size Agnostic, Compute-Free, Memorization-based Inference of Deep Learning

The rapid advancement of deep neural networks has significantly improved...

Please sign up or login with your details

Forgot password? Click here to reset