The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 30-39

  Chazelle, Bernard ^a   Kilian, Joe ^b   Rubinfeld, Ronitt ^b   Tal, Ayellet ^a  

^a PRINCETON UNIVERSITY   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIT SIZE ENCODING; BLOOMIER FILTERS; CHERNOFF BOUNDS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DATABASE SYSTEMS; ERROR ANALYSIS; PROBABILITY; PROBLEM SOLVING; SET THEORY; VECTORS;

DATA STRUCTURES;

EID: 1842473700     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Bloom, B. Space/time tradeoffs in in hash coding with allowable errors, CACM 13 (1970), 422-426.
2. Broder, A., Mitzenmacher, M. Network applications of Bloom filters: a survey, Allerton 2002.
3. Brodnik, A., Munro, J.I., Membership in constant time and almost minimum space, SIAM J. Comput. 28 (1999), 1628-1640.
4. Buhrman, H., Miltersen, P.B., Radhakrishnan, J., Venkatesh, S. Are bitvectors optimal? Proc. 32th STOC (2000), 449-458.
5. Byers, J., Considine, J., Mitzenmacher, M. Informed content delivery over adaptive overlay networks, Proc. ACM SIGCOMM 2002, Vol. 32:4, Computer Communication Review (2002), 47-60.
6. Capalbo, M., Reingold, O., Vadhan, S., Wigderson, A. Randomness conductors and constant-degree expansion beyond the degree /2 barrier, Proc. 34th STOC (2002), 659-668.
7. Cohen, S., Matias, Y. Spectral Bloom filters, SIGMOD 2003.
8. Cuena-Acuna, F.M., Peery, C., Martin, R.P., Nguyen, T.D. PlanetP: Using gossiping to build content addressable peer-to-peer information sharing communities, Rutgers Technical Report DCS-TR-487, 2002.
9. Estan, C., Varghese, G. New directions in traffic measurement and accounting, Proc. ACM SIGCOMM 2002, Vol 32:4, Computer Communication Review (2002), 323-336.
10. Fan, L., Cao. P., Almeida, J., Broder, A. Summary cache: a scalable wide-area web cache sharing protocol, IEEE /ACM Transactions on Networking, 8 (2000), 281-293.
11. Fang, M., Shivakumar, N., Garcia-Molina, H., Motwani, R., Ullman. J. Computing iceberg queries efficiently, Proc. 24th Int. Conf. on VLDB (1998), 299-310.
12. Feng, W.-C., Shin, K.G., Kandlur, D., Saha, D. Stochastic fair blue: A queue management algorithm for enforcing fairness, INFOCOM '01 (2001), 1520-1529.
13. Fredman, M.L., Komlos, J., Szemeredi, E. Storing a sparse table with 0(1) worst case access time, J. ACM 31 (1984), 538-544.
14. Gremillion, L.L. Designing a Bloom Filter for differential file access, Comm. ACM 25 (1982), 600-604.
15. Hsiao, P. Geographical region summary service for geographical routing, Mobile Computing and Communications Review 5 (2001), 25-39.
16. Kleitman, D.J., Spencer, J. Families of k-independent sets, Discrete Math 6 (1973), 255-262.
17. Ledlie, J., Taylor, J., Serban, L., Seltzer, M. Self-organization in peer-to-peer systems, Proc. 10th European SIGOPS Workshop, September 2002.
18. Li, Z., Ross, K.A. PERF join: an alternative to two-way semijoin and bloomjoin CIKM '95, Proc. 1995 In-ternational Conference on Information and Knowledge Management, 137-144, November 1995.
19. Luby, M. LT codes, Proc. 43rd Annu. IEEE Symp. Foundat. Comput. Sci., 2002.
20. Mackert, L., Lohman, G. R* optimizer validation and performance for distributed queries, Proc. Int'l. Conf. on VLDB (1986), 149-159.
21. Manber, U., Wu, S. An algorithm for approximate membership checking with application to password security, Information Processing Letters 50 (1994), 191-197.
22. McIlroy, M.D. Development of a spelling list, IEEE Trans. on Communications, COM-30 (1982), 91-99.
23. Mitzenmacher, M. Compressed Bloom filters, IEEE Transactions on Networking 10 (2002).
24. Mullin, J.K. Optimal semijoins for distributed database systems, IEEE Transactions on Software Engineering 16 (1990).
25. Razborov, A.A. Applications of matrix methods to the theory of lower bounds in computational complexity, Combinatorica 10 (1990), 81-93.
26. Rhea, S.C., Kubiatowicz, J. Probabilistic location and routing, Proceedings of INFOCOM 2002.
27. Rousskov, A., Wessels, D. Cache digests, Computer Networks and ISDN Systems, 30(22-23), 2155-2168, 1998.
28. Sipser, M., Spielman, D.A. Expander codes, IEEE Trans. Inform. Theory 42 (1996), 1710-1722.
29. Snoeren, A.C., Partridge, C., Sanchez, L.A., Jones, C.E., Tchakountio, F., Kent, S.T., Strayer W.T. Hash-based IP traceback, Proc. ACM SIGCOMM 2001, Vol. 31:4, Computer Communication Review, 3-14, August 2001.
30. Whitaker, A., Wetherall, D. Forwarding without loops in Icarus, Proc. 5th OPENARCH (2002), 63-75.