Simple summaries for hashing with multiple choices

43rd Annual Allerton Conference on Communication, Control and Computing 2005

Volumn 3, Issue , 2005, Pages 1453-1462

  Kirsch, Adam ^a   Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (21)

1. Y. Azar, A. Broder, A. Karlin, and E. Upfal. Balanced allocations. SIAM Journal of Computing 29:1, pp. 180-200, 1999.
2. B. Bloom. Space/time tradeoffs in in hash coding with allowable errors. Communications of the ACM, 13 (7): 422-426, 1970.
3. A. Broder and A. Karlin. Multilevel adaptive hashing. In Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 43-53, 1990.
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. J. Byers, J. Considine, and M. Mitzenmacher Geometric generalization of the power of two choices. In Proc. of the 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 54-63, 2004.
7. P. Bose, H. Guo, E. Kranakis, A. Maheshwari, P. Morin, J. Morrison, M. Smid, and Y. Tang. On the falsepositive rate of Bloom filters. Submitted. http://cg.scs.carleton.ca/~morin/publications/ds/ bloom-submitted.pdf
8. 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 Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp 30-39, 2004.
9. M. Dahlin. Interpreting stale load information. IEEE Transactions on Parallel and Distributed Systems, 11 (10), pp. 1033-1047, 2000.
10. P. C. Dillinger and P. Manolios. Fast and accurate bitstate verification for SPIN. In Proceedings of the 11th International SPIN Workshop on Model Checking of Software (SPIN), pp. 57-75, 2004.
11. 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.
12. G.H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures In Pascal and C, Second Edition. Addison-Wesley Publishing Company, 1991.
13. A. Kirsch and M. Mitzenmacher. Building a better Bloom filter. Harvard University Computer Science Technical Report TR-02-05, 2005. ftp://ftp.deas.harvard.edu/techreports/tr-02-05.pdf.
14. M. Mitzenmacher. The power of two choices in randomized load balancing. Ph. D. thesis, U.C. Berkeley, 1996.
15. M. Mitzenmacher. How useful is old information? IEEE Transactions on Parallel and Distributed Systems, 11 (1), pp. 6-20, 2000.
16. M. Mitzenmacher. Compressed Bloom Filters. IEEE/ACM Transactions on Networking, 10 (5): 613-620, 2002.
17. Mitzenmacher, M., Richa, A., and Sitaraman, R. The Power of Two Choices: A Survey of Techniques and Results. Kluwer Academic Publishers, Norwell, MA, 2001, pp. 255-312. edited by P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim.
18. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
19. 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 (SODA), pp. 823-829, 2005.
20. M. V. Ramakrishna. Practical performance of Bloom filters and parallel free-text searching. Communications of the ACM, 32 (10): 1237-1239, 1989.
21. H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood. Fast hash table lookup using extended Bloom filter: an aid to network processing. In Proceedings of ACM SIGCOMM, pp. 181-192, 2005.