Bloomier filters: A second look

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

Volumn 5193 LNCS, Issue , 2008, Pages 259-270

  Charles, Denis ^a   Chellapilla, Kumar ^a  

^a MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BLOOM FILTERS; CONSTANT TIME; LINEAR TIME; PROBABILITY OF FALSE POSITIVES; SPACE EFFICIENCIES; SPACE EFFICIENT; SPACE UTILIZATION;

DATA STRUCTURES;

EID: 57749180356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87744-8_22     Document Type: Conference Paper

References (18)

1. Bloom, B.: Space/time tradeoffs in hash coding with allowable errors. Comm. of the ACM 13, 422-426 (1970)
2. Bollobás, B.: The evolution of random graphs. Trans. Amer. Math. Soc. 286, 257-274 (1984)
3. Broder, A., Mitzenmacher, M.: Network applications of Bloom filters: a survey, Allerton (2002)
4. Byers, J., Considine, J., Mitzenmacher, M.: Informed content delivery over adaptive overlay networks. In: Proc. ACM SIGCOMM 2002. Comp. Communication Review, vol. 34(4), pp. 47-60 (2002)
5. Calkin, N.J.: Dependent sets of constant weight binary vectors. Combinatorics, Probability and Computing 6(3), 263-271 (1997)
6. Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The Bloomier filter: an efficient data structure for static support lookup tables. In: Proc. of the 15th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2004), pp. 30-39 (2004)
7. Charles, D., Chellapilla. K.: Bloomier Filters: A second look (extended version) (2008) arXiv:0807.0928
8. Cohen, S., Matias, Y.: Spectral Bloom filters. In: ACM SIGMOD (2003)
9. Czech, Z., Havas, G., Majewski, B.S.: An optimal algorithm for generating minimal perfect hash functions. Information Processing Letters 43(5), 257-264 (1992)
10. Czech, Z., Havas, G., Majewski, B.S., Wormald, N.C.: Graphs, hypergraphs and hashing. In: van Leeuwen. J. (ed.) WG 1993. LNCS. vol. 790, pp. 153-165. Springer, Heidelberg (1994)
11. Dietzfelbinger, M., Pagh, R.: Succinct Data Structures for Retrieval and Approximate Membership. In: ICALP (to appear, 2008)
12. Erdos, P., Rényi, A.: On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5, 17-61 (1960)
13. Fan, L., Cao, P., Almeida, J., Broder. A.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking 8, 281-293 (2000)
14. Fang, M., Shivakumar, N., Garcia-Molina, H., Motwani, R., Ullman, J.: Computing iceberg queries efficiently. In: Proc. 24th Int. Conf. on VLDB, pp. 299-310 (1998)
15. Geller, D., Kra, I., Popescu, S., Simanca, S.: On circulant matrices (manuscript), http://www.math.sunysb.edu/~sorin
16. Gremillion, L.L.: Designing a Bloom filter for differential file access. Comm. of the ACM 25, 600-604 (1982)
17. Mitzenmacher, M.: Compressed Bloom filters. IEEE Transactions on Networking 10 (2002)
18. Rhea, S.C. Kubiatowicz, J.: Proabilistic location and routing. In: Proceedings of INFOCOMM (2002)