Improving the performance of Invertible Bloom Lookup Tables

Authors:
Salvatore Pontarelli;Pedro Reviriego;Michael Mitzenmacher
Affiliations:
University of Rome "Tor Vergata", Via del Politecnico 1, 00133, Rome, Italy;Universidad Antonio de Nebrija, C/ Pirineos, 55, E-28040 Madrid, Spain;Harvard University, 33 Oxford Street, Cambridge, MA 02138, USA
Venue:
Information Processing Letters
Year:
2014

Citing 3
Cited 0

Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters

IEEE Transactions on Knowledge and Data Engineering
What's the difference?: efficient set reconciliation without prior context

Proceedings of the ACM SIGCOMM 2011 conference

Quantified Score

Hi-index	0.89

Visualization

Abstract

Invertible Bloom Lookup Tables (IBLTs) have been recently introduced as an extension of traditional Bloom filters. IBLTs store key-value pairs. Unlike traditional Bloom filters, IBLTs support both a lookup operation (given a key, return a value) and an operation that lists out all the key-value pairs stored. One issue with IBLTs is that there is a probability that a lookup operation will return ''not found'' for a key. In this paper, a technique to reduce this probability without affecting the storage requirement and only moderately increasing the search time is presented and evaluated. The results show that it can significantly reduce the probability of not returning a value that is actually stored in the IBLT. The overhead of the modified search procedure, compared to the standard IBLT search procedure, is small and has little impact on the average search time.