Why simple hash functions work: Exploiting the entropy in a data stream

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 746-755

  Mitzenmacher, Michael ^a   Vadhan, Salil ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOOM FILTERING; DATASTREAM (CO); PERFORMANCE GUARANTEES; RANDOM SOURCES; TO MANY;

DATA STRUCTURES; ELECTRIC NETWORK ANALYSIS; ENTROPY; FUNCTIONS; PROBABILITY DENSITY FUNCTION;

HASH FUNCTIONS;

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

References (35)

1. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced Allocations. SI AM Journal on Computing, 29(1):180-200, 2000.
2. C. H. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion. SJAM Journal on Computing, 17(2):210-229, 1988. Special issue on cryptography.
3. B. H. Bloom. Space/Time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM, 13(7):422-426, 1970.
4. A. Blum and J. Spencer. Coloring random and semirandom k-colorable graphs. Journal of Algorithms, I9(2):204-234, 1995.
5. A. Broder and M. Mitzenmacher. Using multiple hash functions to improve IP lookups. In INFOCOM 2001: Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, pages 1454-1463, 2001.
6. A. Broder and M. Mitzenmacher. Network Applications of Bloom Filters: A Survey. Internet Mathematics, 1(4):485-509, 2005.
7. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143-154, 1979.
8. B. Chor and O. Goldreich. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. SIAM J. Comput., 17(2):230-261, Apr. 1988.
9. S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. Lockwood. Deep packet inspection using parallel bloom filters. IEEE Micro, 24(1):52-61, 2004.
10. M. Dietzfelbinger and P. Woelfel. Almost random graphs with simple hash functions. In STOC '03: Proceedings of the thirty-fifth annual A CM symposium on Theory of computing, pages 629-638, New York, NY, USA, 2003. ACM Press.
11. Y. Dodis, R. Gennaro, J. Håstad, H. Krawczyk, and T. Rabin. Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes. In M. K. Franklin, editor, CRYPTO, volume 3152 of Lecture Notes in Computer Science, pages 494-510. Springer, 2004.
12. G. Gonnet and R. Baeza-Yates. Handbook of algorithms and data structures: in Pascal and C. Addison- Wesley Longman Publishing Co., Inc. Boston, MA, USA, 1991.
13. R. Impagliazzo, L. A. Levin, and M. Luby. Pseudorandom Generation from one-way functions (Extended Abstracts). In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 12-24, Seattle, Washington, 15-17 May 1989.
14. R. Impagliazzo and D. Zuckerman. How to Recycle Random Bits. In 30th Annual Symposium on Foundations of Computer Science, pages 248-253, Research Triangle Park, North Carolina, 30 Oct.-1 Nov. 1989. IEEE.
15. A. Kirsch and M. Mitzenmacher. Less Hashing, Same Performance: Building a Better Bloom Filter. In Proceedings of the 14th Annual European Symposium on Algorithms, pages 456-467, 2006.
16. D. Knuth. 'The Art of Computer Programming, Volume 3: Sorting and Searching. Addison Wesley Longman Publishing Co., Inc. Redwood City, CA, USA, 1998.
17. S. Muthukrishnan. Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science, 1(2), 2005.
18. N. Nisan and A. Ta-Shma. Extracting Randomness: A Survey and New Constructions. Journal of Computer and System Sciences, 58(1):148-173, 1999.
19. N. Nisan and D. Zuckerman. Randomness is Linear in Space. J. Comput. Syst. Sci., 52(1):43-52, Feb. 1996.
20. A. Ostlin and R. Pagh. Uniform hashing in constant time and linear space. Proceedings of the thirtyfifth annual A CM symposium on Theory of computing, pages 622-628, 2003.
21. A. Pagh, R. Pagh, and M. Ruzic. Linear probing with constant independence. In STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pages 318-327, New York, NY, USA, 2007. ACM Press.
22. R. Pagh and F. Rodler. Cuckoo hashing. Journal of Algorithms, 51(2):122-144, 2004.
23. M. V. Ramakrishna. Hashing practice: analysis of hashing and universal hashing. In SIGMOD '88: Proceedings of the 1988 ACM SIGMOD international conference on Management of data, pages 191-199, New York, NY, USA, 1988. ACM Press.
24. M. V. Ramakrishna. Practical performance of Bloom filters and parallel free-text searching. Communications of the ACM, 32(10):1237-1239, 1989.
25. M. V. Ramakrishna, E. Fu, and E. Bahcekapili. Efficient Hardware Hashing Functions for High Performance Computers. IEEE Trans. Comput., 46(12):1378-1381, 1997.
26. M. Santha and U. V. Vazirani. Generating Quasi-random Sequences from Semi-random Sources. J. Comput. Syst. Sci., 33(1):75-87, Aug. 1986.
27. J. P. Schmidt and A. Siegel. The Analysis of Closed Hashing under Limited Randomness (Extended Abstract). In STOC, pages 224-234. ACM, 1990.
28. R. Shaltiel. Recent Developments in Explicit Constructions of Extractors. Bulletin of the European Association for Theoretical Computer Science, 77:67-95, June 2002.
29. A. Siegel. On universal classes of extremely random constant-time hash functions. SI AM Journal on Computing, 33(3):505-543 (electronic), 2004.
30. D. A. Spielman and S.-H. Teng. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. Journal of the ACM, 51(3):385-463 (electronic), 2004.
31. M. Thorup and Y. Zhang. Tabulation based 4- universal hashing with applications to second moment estimation. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 615-624 (electronic), New York, 2004. ACM.
32. B. Vöcking. How asymmetry helps load balancing. Journal of the ACM, 50(4):568-589, 2003.
33. M. N. Wegman and J. L. Carter. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, 22(3):265-279, 1981. Special issue dedicated to Michael Machtey.
34. P. Woelfel. Asymmetric balanced allocation with simple hash functions. In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithms, pages 424-433, New York, NY, USA, 2006. ACM Press.
35. D. Zuckerman. Simulating BPP Using a General Weak Random Source. Algorithmica, 16(4/5):367-391, Oct./Nov. 1996.