An optimal bloom filter replacement based on matrix solving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5675 LNCS, Issue , 2009, Pages 263-273

  Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION EXAMPLES; BLOOM FILTERS; DISTRIBUTED STORAGE SYSTEM; HASHTABLE; MATRIX; MEMBERSHIP QUERY; MEMORY BITS; PREPROCESSING TIME; QUERY TIME; RANDOM VALUES; SPACE REQUIREMENTS;

BLOOMS (METAL); COMPUTATION THEORY; COST REDUCTION; DATA STRUCTURES; HASH FUNCTIONS; KEYS (FOR LOCKS); SPACE PROBES;

COMPUTATIONAL METHODS;

EID: 70350339307     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03351-3_25     Document Type: Conference Paper

References (18)

1. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422-426 (1970)
2. Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey (2002)
3. Brodnik, A., Ian Munro, J.: Membership in constant time and almost-minimum space. SIAM J. Comput. 28(5), 1627-1640 (1999)
4. Charles, D., Chellapilla, K.: Bloomier filters: A second look. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 259-270. Springer, Heidelberg (2008)
5. Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The bloomier filter: an efficient data structure for static support lookup tables. In: SODA 2004: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 30-39. Society for Industrial and Applied Mathematics (2004)
6. Cohen, S., Matias, Y.: Spectral bloom filters. In: SIGMOD 2003: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp. 241-252. ACM, New York (2003)
7. Dietzfelbinger, M., Pagh, R.: Succinct data structures for retrieval and approximate membership (extended abstract). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 385-396. Springer, Heidelberg (2008)
8. Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Trans. Netw. 8(3), 281-293 (2000)
9. Gremillion, L.L.: Designing a bloom filter for differential file access. Commun. ACM 25(9), 600-604 (1982)
10. Manber, U., Wu, S.: An algorithm for approximate membership checking with application to password security. Inf. Process. Lett. 50(4), 191-197 (1994)
11. McIlroy, M.D.: Development of a spelling list. IEEE Transactions on Communications 30(1), 91-99 (1982)
12. Mitzenmacher, M.: Compressed bloom filters. IEEE/ACM Trans. Netw. 10(5), 604-612 (2002)
13. Mullin, J.K., Margoliash, D.J.: A tale of three spelling checkers. Softw. Pract. Exper. 20(6), 625-630 (1990)
14. Mullin, J.K.: A second look at bloom filters. Commun. ACM 26(8), 570-571 (1983)
15. Pagh, A., Pagh, R., Srinivasa Rao, S.: An optimal bloom filter replacement. In: SODA 2005: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 823-829. Society for Industrial and Applied Mathematics (2005)
16. Spafford, E.H.: Opus: Preventing weak password choices. Computer and Security 10, 273-278 (1992)
17. Villard, G.: A study of coppersmith's block wiedemann algorithm using matrix polynomials
18. Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Trans. Information Theory IT-32(1), 54-62 (1986)