Cache-, hash- and space-efficient Bloom filters

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

Volumn 4525 LNCS, Issue , 2007, Pages 108-121

  Putze, Felix ^a   Sanders, Peter ^a   Singler, Johannes ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; QUERY PROCESSING; SIGNAL FILTERING AND PREDICTION;

APPROXIMATE MEMBERSHIP QUERIES; BLOOM FILTERS; SPACE EFFICIENCY;

DATA STRUCTURES;

EID: 37149047145     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72845-0_9     Document Type: Conference Paper

References (12)

1. Bloom, B.H.: Space-time trade-offs in hash coding with allowable errors. Communications of the ACM, vol. 13(7) (1970)
2. Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. Internet Mathematics, vol. 1(4) (2004)
3. Cleary, J.C.: Compact hash tables using bidirectional linear probing. IEEE Transactions on Computers 33(9), 828-834 (1984)
4. Dillinger, P.C., Manolios, P.: Bloom filters in probabilistic verification. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 367-381. Springer, Heidelberg (2004)
5. Dillinger, P.C., Manolios, P.: Fast and accurate bitstate verification for SPIN. In: Graf, S., Mounier, L. (eds.) Model Checking Software. LNCS, vol. 2989, pp. 57-75. Springer, Heidelberg (2004)
6. Fan, L., Cao, P., Almeida, J.M., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM TON 8(3), 281-293 (2000)
7. Kirsch, A., Mitzenmacher, M.: Less hashing, same performance: Building a better Bloom filter. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 456-467. Springer, Heidelberg (2006)
8. Manber, U., Wu, S.: An algorithm for approximate membership checking with application to password security. Information Processing Letters 50(4), 191-197 (1994)
9. Mitzenmacher, M.: Compressed Bloom filters. In: PODC 2001, pp. 144-150 (2001)
10. Moffat, A., Turpin, A.: Compression and Coding Algorithms. Kluwer Academic Publishers, Dordrecht (2002)
11. Pagh, A., Pagh, R., Rao, S.S.: An optimal Bloom filter replacement. In: SODA 2005, pp. 823-829 (2005)
12. Sanders, P., Transier, F.: Intersection in integer inverted indices. In: ALENEX 2007 (2007)