NDLI: Invertible bloom lookup tables

Content Provider	IEEE Xplore Digital Library
Author	Goodrich, M.T. Mitzenmacher, M.
Copyright Year	2011
Description	Author affiliation: School of Engineering and Applied Sciences, Harvard University. Supported in part by the NSF under grants IIS-0964473, CCF-0915922 and CNS-0721491 (Mitzenmacher, M.) \|\| Dept. of Computer Science, University of California, Irvine. Supported in part by the NSF under grants 0724806, 0713046, 0847968, and 0953071 (Goodrich, M.T.)
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.
Starting Page	792
Ending Page	799
File Size	512633
Page Count	8
File Format	PDF
ISBN	9781457718175
e-ISBN	9781457718182
DOI	10.1109/Allerton.2011.6120248
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-09-28
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Fault tolerance Databases Fault tolerant systems Random access memory Data structures Probabilistic logic Polynomials
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Invertible Bloom Lookup Tables

Design of Fault Tolerant Network Interfaces for NoCs

Data logging: a method for efficient data updates in constantly active RAIDs

A CAM fault-tolerant strategy for multiprocessor by using bloom filter and history lookup table

Comparing the robustness of fault-tolerant enhancements when applied to lookup tables and random logic for nano-computing

A novel design flow for fault-tolerant computing

Fault-tolerant resynthesis with dual-output LUTs

Parallel peeling algorithms

Invertible Bloom Lookup Tables with Less Memory and Randomness

Invertible bloom lookup tables

Similar Documents

Invertible Bloom Lookup Tables

Design of Fault Tolerant Network Interfaces for NoCs

Data logging: a method for efficient data updates in constantly active RAIDs

A CAM fault-tolerant strategy for multiprocessor by using bloom filter and history lookup table

Comparing the robustness of fault-tolerant enhancements when applied to lookup tables and random logic for nano-computing

A novel design flow for fault-tolerant computing

Fault-tolerant resynthesis with dual-output LUTs

Parallel peeling algorithms

Invertible Bloom Lookup Tables with Less Memory and Randomness

Invertible bloom lookup tables