Using the power of two choices to improve bloom filters

Internet Mathematics

Volumn 4, Issue 1, 2007, Pages 17-33

  Lumetta, Steve ^a   Mitzenmacher, Michael ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79953769032     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2007.10129136     Document Type: Article

References (15)

1. Y. Azar, A. Broder, A. Karlin, and E. Upfal. “Balanced Allocations.” SIAM Journal of Computing 29:1 (1999), 180–200.
2. B. Bloom. “Space/Time Tradeoffs in Hash Coding with Allow-able Errors.” Communications of the ACM 13:7 (1970), 422–426.
3. A. Broder and M. Mitzenmacher. “Network Applications of Bloom Filters: A Survey.” Internet Mathematics 1:4 (2004), 485–509.
4. M. Dietzfelbinger and P. Woelfel. “Almost Random Graphs with Simple Hash Functions.” In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 629–638. New York: ACM Press, 2003.
5. 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 (2000), 281–293.
6. A. Kamath, R. Motwani, K. Palem, and P. Spirakis. “Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture.” Random Structures and Algorithms 7:1 (1995), 59–80.
7. A. Kirsch and M. Mitzenmacher. “Building a Better Bloom Filter.” Harvard University Computer Science Technical Report TR-02-05, 2005. Available at ftp://ftp.deas.harvard.edu/techreports/tr-02-05.pdf.
8. S. Kumar and P. Crowley. “Segmented Hash: An Efficient Hash Table Implementation for High-Performance Networking Subsystems.” In Proceedings of the 2005 Symposium on Architecture for Networking and Communications Systems, pp. 91–103. New York: ACM Press, 2005.
9. T. G. Kurtz. “Solutions of Ordinary Differential Equations as Limits of Pure Jump Markov Processes.” Journal of Applied Probability 7 (1970), 49–58.
10. M. Mitzenmacher. “The Power of Two Choices in Randomized Load Balancing.” PhD diss., University of California, Berkeley, 1996.
11. M. Mitzenmacher, A. Richa, and R. Sitaraman. “The Power of Two Random Choices: A Survey of Techniques and Results.” In Handbook of Randomized Computing, Vol. I, edited by P. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim, pp. 255–312. Norwell, MA: Kluwer Academic Publishers, 2001.
12. 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. Philadelphia: SIAM, 2005.
13. A. Shwartz and A. Weiss. Large Deviations for Performance Analysis. London: Chapman and Hall, 1995.
14. B. Vöcking. “How Asymmetry Helps Load Balancing.” In Proceedings of the 40th Annual Sumposium on Foundations of Computer Science, pp. 131–140. Los Alamitos, CA: IEEE Computer Society, 1999.
15. N. Wormald. “Differential Equations for Random Processes and Random Graphs.” Ann. Appl. Probab. 5:4 (1995), 1217–1235.