A lower bound for dynamic approximate membership data structures

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 797-804

  Lovett, Shachar ^a   Porat, Ely ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Bloom filters; Dynamic data structures; Lower bounds

Indexed keywords

BLOOMS (METAL); DATA STRUCTURES; DIGITAL STORAGE; ENTROPY; ERROR ANALYSIS; ITERATIVE METHODS; QUERY PROCESSING;

BLOOM FILTERS; CONSTANT FACTORS; DISTRIBUTED SYSTEMS; DYNAMIC DATA STRUCTURE; FALSE NEGATIVE ERRORS; LOWER BOUNDS; MEMORY REQUIREMENTS; QUERY ALGORITHMS;

DISTRIBUTED DATABASE SYSTEMS;

EID: 78751478325     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.81     Document Type: Conference Paper

References (9)

1. Yuriy Arbitman, Moni Naor, and Gil Segev. Backyard cuckoo hashing: Constant worst-case operations with a succinct representation. In FOCS '10: Proceedings of the 51st annual IEEE Symposium on Foundations of Computer Science, 2010. To appear.
2. Burton H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
3. A. Broder and M. Mitzenmacher. Network applications of bloom filters: a survey. Internet Math., 1(4):485-509, 2003.
4. Larry Carter, Robert Floyd, John Gill, George Markowsky, and Mark Wegman. Exact and approximate membership testers. In STOC '78: Proceedings of the tenth annual ACM symposium on Theory of computing, pages 59-65, New York, NY, USA, 1978. ACM.
5. Martin Dietzfelbinger and Rasmus Pagh. Succinct data structures for retrieval and approximate membership (extended abstract). In ICALP '08: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I, pages 385-396, Berlin, Heidelberg, 2008. Springer-Verlag.
6. Yossi Matias and Ely Porat. Efficient pebbling for list traversal synopses with application to program rollback. Theor. Comput. Sci., 379(3):418-436, 2007.
7. Ely Porat. An optimal bloom filter replacement based on matrix solving. In CSR '09: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications, pages 263-273, Berlin, Heidelberg, 2009. Springer-Verlag.
8. Anna Pagh, Rasmus Pagh, and S. Srinivasa Rao. An optimal bloom filter replacement. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 823-829, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
9. Rajeev Raman and Satti Srinivasa Rao. Succinct dynamic dictionaries and trees. In ICALP'03: Proceedings of the 30th international conference on Automata, languages and programming, pages 357-368, Berlin, Heidelberg, 2003. Springer-Verlag.