Weighted bloom filter

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 2304-2308

  Bruck, Jehoshua ^a   Gao, Jie ^b   Jiang, Anxiao ^c  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b Stony Brook University   (United States)

^c TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Bloom filter; Combinatorics; Membership query

Indexed keywords

BLOOM FILTER; NON UNIFORM MEMBERSHIP; QUERY FREQUENCIES;

DATA COMPRESSION; INFORMATION DISSEMINATION; OPTIMAL SYSTEMS; RANDOM PROCESSES;

DATA STRUCTURES;

EID: 39049088554     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261978     Document Type: Conference Paper

References (24)

1. M. Adler, S. Chakrabarti, M. Mitzenmacher, and L. Rasmussen. Parallel randomized load balancing. Random Structures and Algorithms, 13(2):159-188, 1998.
2. B. Babcock and C. Olston. Distributed top-k monitoring. In SIGMOD '03: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pages 28-39, New York, NY, USA, 2003. ACM Press.
3. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
4. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web caching and zipf-like distributions: evidence and implications. In Proc. IEEE INFOCOM'99, pages 126-134, 1999.
5. A. Broder and M. Mitzenmacher. Network applications of bloom filters: A survey. In Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing, pages 636-646, 2002.
6. J. Bruck, J. Gao, and A. A. Jiang. Weighted bloom filter. Technical Report ETR072, Distributed Information Systems Group, Department of Electrical Engineering, California Institute of Technology, 2006. http://www.paradise. caltech.edu/papers/etr072.pdf.
7. L. Carter, R. Floyd, J. Gill, G. Markowsky, and M. Wegman. Exact and approximate membership testers. In STOC '78: Proceedings of the tenth annual ACM symposium on Theory of computing, pages 59-65, 1978.
8. F. Chang, W. Feng, and K. Li. Approximate caches for packet classification. In Proceedings of INFOCOM, volume 4, pages 2196-2207, Hong Kong, China, 2004.
9. B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal. The Bloomier filter: An efficient data structure for static support lookup tables. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pages 30-39, New Orleans, LA., United States, 2004.
10. S. Cohen and Y. Matias. Spectral Bloom filters. In Proc. SIGMOD, pages 241-252, 2003.
11. G. Cormode and S. Muthukrishnan. What's hot and what's not: tracking most frequent items dynamically. In PODS '03: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 296-306, New York, NY, USA, 2003. ACM Press.
12. E. D. Demaine, A. López-Ortiz, and J. I. Munro. Frequency estimation of internet packet streams with limited space. In ESA '02: Proceedings of the 10th Annual European Symposium on Algorithms, pages 348-360, London, UK, 2002. Springer-Verlag.
13. N. Duffield and M. Grossglauser. Trajectory sampling with unreliable reporting. In Proc. INFOCOM'04, volume 3, pages 1570-1581, Hong Kong, China, 2004.
14. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking, 8(3):281-293, 2000.
15. Google. Google Zeitgeist - search patterns, trends and surprises according to google, http://www.google.com/press/zeitgeist.html.
16. R. M. Karp, S. Shenker, and C. H. Papadimitriou. A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst., 28(1):51-55, 2003.
17. A. Kumar, J. Xu, and E. W. Zegura. Efficient and scalable query routing for unstructured peer-to-peer networks. In Proc. INFOCOM'05. Miami, Florida, U.S.A., 2005.
18. M. Mitzenmacher. Compressed bloom filters. IEEE/ACM Transactions on Networking, 10(5):604-612, 2002.
19. P. Mutaf and C. Castelluccia. Compact neighbor discovery. In Proc. INFOCOM'05. Miami, FL, USA, 2005.
20. S. C. Rhea and J. Kubiatowicz. Probabilistic location and routing. In Proc. INFOCOM'02. volume 3, pages 1248-1257, 2002.
21. P. Rodriguez, C. Spanner, and E. W. Biersack. Analysis of web caching architectures: hierarchical and distributed caching. IEEE/ACM Transactions on Networking, 9(4):404-418, 2001.
22. H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood. Fast hash table lookup using extended Bloom filter: An aid to network processing. In Proc. SIGCOMM, Philadelphia, PA, USA, 2005.
23. F. Ye, H. Luo, S. Lu, and L. Zhang. Statistical en-route filtering of injected false data in sensor networks. In Proc. INFOCOM'04, volume 4, pages 2446-2457, 2004.
24. C. K. Zipf. Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology. Addison Wesley Press, Inc., Cambridge, MA, 1949.