Invertible bloom lookup tables
Michael T. Goodrich,Michael Mitzenmacher +1 more
- pp 792-799
TLDR
The Bloom filter data structure as mentioned in this paper allows the insertion, deletion, and lookup of key-value pairs with high probability, as long the number of keyvalue pairs is below a designed threshold.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 the pairs it contains 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 entries are later 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.read more
Citations
More filters
Journal ArticleDOI
Internet of Things: A Survey on Enabling Technologies, Protocols, and Applications
TL;DR: An overview of the Internet of Things with emphasis on enabling technologies, protocols, and application issues, and some of the key IoT challenges presented in the recent literature are provided and a summary of related research work is provided.
Proceedings ArticleDOI
Elastic sketch: adaptive and fast network-wide measurements
Tong Yang,Jie Jiang,Peng Liu,Qun Huang,Junzhi Gong,Yang Zhou,Rui Miao,Xiaoming Li,Steve Uhlig +8 more
TL;DR: The Elastic sketch is proposed, which is adaptive to currently traffic characteristics, generic to measurement tasks and platforms, and implemented on six platforms to process typical measurement tasks.
Journal ArticleDOI
Optimizing Bloom Filter: Challenges, Solutions, and Comparisons
TL;DR: In this article, a survey of the existing literature on BF optimization, covering more than 60 variants, is presented, and a comprehensive analysis and qualitative comparison are conducted from the perspectives of BF components.
Proceedings ArticleDOI
What's the difference?: efficient set reconciliation without prior context
TL;DR: A synopsis structure that allows two nodes to compute the elements belonging to the set difference in a single round with communication overhead proportional to the size of the difference times the logarithm of the keyspace is described.
Proceedings ArticleDOI
Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing
TL;DR: This work proposes a meta-framework, called Cold Filter (CF), that enables faster and more accurate stream processing, and can accurately estimate both cold and hot items, giving it a genericity that makes it applicable to many stream processing tasks.
References
More filters
Journal ArticleDOI
Space/time trade-offs in hash coding with allowable errors
TL;DR: Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.
Journal ArticleDOI
Network Applications of Bloom Filters: A Survey
TL;DR: The aim of this paper is to survey the ways in which Bloom filters have been used and modified in a variety of network problems, with the aim of providing a unified mathematical and practical framework for understanding them and stimulating their use in future applications.
Journal ArticleDOI
An improved data stream summary: the count-min sketch and its applications
Graham Cormode,S. Muthukrishnan +1 more
TL;DR: In this paper, the authors introduce a sublinear space data structure called the countmin sketch for summarizing data streams, which allows fundamental queries in data stream summarization such as point, range, and inner product queries to be approximately answered very quickly; in addition it can be applied to solve several important problems in data streams such as finding quantiles, frequent items, etc.
Journal ArticleDOI
Private information retrieval
TL;DR: This work describes schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database, so that each individual server gets no information on the identity of the item retrieved by the user.
Journal ArticleDOI
Software protection and simulation on oblivious RAMs
Oded Goldreich,Rafail Ostrovsky +1 more
TL;DR: This paper shows how to do an on-line simulation of an arbitrary RAM by a probabilistic oblivious RAM with a polylogaithmic slowdown in the running time, and shows that a logarithmic slowdown is a lower bound.