Bloom filters via d-left hashing and dynamic bit reassignment extended abstract

44th Annual Allerton Conference on Communication, Control, and Computing 2006

Volumn 2, Issue , 2006, Pages 877-883

  Bonomi, Flavio ^a   Mitzenmacher, Michael ^b   Panigraphy, Rina ^c   Singh, Sushil ^a   Varghese, George ^d  

^a CISCO SYSTEMS   (United States)

^b HARVARD UNIVERSITY   (United States)

^c STANFORD UNIVERSITY   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HARDWARE;

BLOOM FILTERS; COUNTING BLOOM FILTERS; D-LEFT HASHING; EXTENDED ABSTRACTS; FALSE POSITIVE; FALSE POSITIVE RATES; HARDWARE IMPLEMENTATIONS; STANDARD CONSTRUCTIONS;

DATA STRUCTURES;

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

References (15)

1. B. Bloom. Space/time tradeoffs in in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
2. F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese. Beyond Bloom filters: From approximate membership checks to approximate state machines. To appear in Proc. of SIGCOMM, 2006.
3. F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese. An Improved Construction for Counting Bloom Filters. To appear in Proc. of ESA, 2006.
4. A. Broder and M. Mitzenmacher. Using multiple hash functions to improve IP Lookups. In Proceedings of IEEE INFOCOM, pp. 1454-1463, 2001.
5. A. Broder and M. Mitzenmacher. Network applications of Bloom filters: A survey. Internet Mathematics, 1(4):485-509, 2004.
6. P. Dillinger and P. Manolios. Fast and Accurate Bitstate Verification for SPIN. In Proceedings of the 11th International SPIN Workshop on Model Checking of Software, 2004.
7. 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.
8. D. Fotakis, R. Pagh, P. Sander, and P. Spirakis. Space Efficient Hash Tables with Worst Case Constant Access Time. In Proceedings of the Twentieth Annual Symposium on Theoretical Aspects of Computer Science, pp. 271-282, 2003.
9. A. Kirsch and M. Mitzenmacher. Simple Summaries for Hashing with Multiple Choices. In Proceedings of the Forty-Third Annual Allerton Conference on Communication, Control, and Computing, 2005.
10. M. Mitzenmacher. Compressed Bloom Filters. IEEE/ACM Transactions on Networking, 10(5):613-620, 2002.
11. M. Mitzenmacher and B. Vöcking. The asymptotics of selecting the shortest of two, improved. In Analytic Methods in Applied Probability: In Memory of Fridrikh Karpelevich, edited by Y. Suhov, American Mathematical Society, 2003.
12. R. Pagh and F. Rodler. Cuckoo Hashing. In Proc. of the 9th Annual European Symposium on Algorithms, pp. 121-133, 2001.
13. R. Panigrahy. Efficient hashing with lookups in two memory accesses. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 830-839, 2005.
14. A. Pagh, R. Pagh, and S. Srinivas Rao. An Optimal Bloom Filter Replacement. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 823-829, 2005.
15. B. Vöcking. How asymmetry helps load balancing. In Proceedings of the 40th IEEE-FOCS, pp. 131-140, 1999.