NDLI: A Space Lower Bound for Dynamic Approximate Membership Data Structures

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Lovett, Shachar Porat, Ely
Copyright Year	2013
Abstract	An approximate membership data structure is a randomized data structure representing a set which supports membership queries. It allows for a small false positive error rate but has no false negative errors. Such data structures were first introduced by Bloom in the 1970s and have since had numerous applications, mainly in distributed systems, database systems, and networks. The algorithm of Bloom (known as a Bloom filter) is quite effective: it can store an approximation of a set $S$ of size $n$ by using only $\approx 1.44 n \log_2(1/\varepsilon)$ bits while having false positive error $\varepsilon$. This is within a constant factor of the information-theoretic lower bound of $n \log_2(1/\varepsilon)$ for storing such sets. Closing this gap is an important open problem, as Bloom filters are widely used in situations where storage is at a premium. Bloom filters have another property: they are dynamic. That is, they support the iterative insertions of up to $n$ elements. In fact, if one removes this requirement, there exist static data structures that receive the entire set at once and can almost achieve the information-theoretic lower bound; they require only $(1+o(1)) n \log_2(1/\varepsilon)$ bits. Our main result is a new lower bound for the space requirements of any dynamic approximate membership data structure. We show that for any constant $\varepsilon>0$, any such data structure that achieves false positive error rate of $\varepsilon$ must use at least $C(\varepsilon) \cdot n \log_2(1/\varepsilon)$ memory bits, where $C(\varepsilon)>1$ depends only on $\varepsilon$. This shows that the information-theoretic lower bound cannot be achieved by dynamic data structures for any constant error rate.
Starting Page	2182
Ending Page	2196
Page Count	15
File Format	PDF
ISSN	00975397
DOI	10.1137/120867044
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	6 (Special Section on the Fiftieth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009))
Volume Number	42
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2013-12-05
Access Restriction	Subscribed
Subject Keyword	Computational difficulty of problems Data structures Bloom filters dynamic data structures lower bounds
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

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