Invertible Bloom Lookup Tables · HackerPapers discussions

Invertible Bloom Lookup Tables — mentioned by thomasmg

Fri, 02 May 2025 17:43:50 GMT

This is a bit similar to count-min sketch, which can be used to calculate frequencies in a stream. Also interesting are "Invertible Bloom Lookup Tables" (IBLT), https://arxiv.org/pdf/1101.2245 , which allow to add and remove data, and allow to retrieve the remaining data if "little" data remains. That means, it can be used for error correction: all all the _correct_ data (let's say 1 GB of correct data) into a 1 MB IBLT. Let's say a downloader finds that the checksum doesn't match: he can download that 1 MB IBLT, and remove the data from his (invalid) download. What remains is the delta: the…

Paper and discussion history. A mention is not an endorsement.

Invertible Bloom Lookup Tables — mentioned by sgentle

Tue, 15 Mar 2016 13:08:29 GMT

I was recently reading about some of the interesting work with invertible bloom filters/invertible bloom lookup tables, eg [0] [1]. There might be either a clever way to exploit IBLTs to to make a low-information query of the data (like "Oblivious Selection from a Table" in [1]), or otherwise there may be a way to use them to more efficiently implement the bloom filter/sharded bloom filter options. My information theory/coding theory is not strong enough to really know, but it might be worth looking into! [0] https://www.ics.uci.edu/~eppstein/pubs/EppGooUye-SIGCOMM-11.... [1]…

Paper and discussion history. A mention is not an endorsement.

Invertible Bloom Lookup Tables — HN submission

Fri, 29 Aug 2014 19:18:14 GMT

Invertible Bloom Lookup Tables (2011)

92 points; 24 discussion replies on HN. Paper and source history. A submission is not an endorsement.