Appendix D. References for Part IV

  • [Alon1999] Alon, N., T. Matias, and M. Szegedy. “The space complexity of approximating the frequency moments.” Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing (1999). http://bit.ly/2W7jG6c.

  • [Bifet2015] Bifet, A., S. Maniu, J. Qian, G. Tian, C. He, W. Fan. “StreamDM: Advanced Data Mining in Spark Streaming,” Data Mining Workshop (ICDMW), November 2015. http://bit.ly/2XlXBSV.

  • [Carter1979] Carter, J. Lawrence, and Mark N. Wegman. “Universal Classes of Hash Functions,” Journal of Computer and System Sciences 18 (1979). http://bit.ly/2EQkkzf.

  • [Conway2012] Conway, D., and J. White. Machine Learning for Hackers. O’Reilly, 2012.

  • [Cormode2003] Cormode, Graham, and S. Muthukrishnan. An Improved Data Stream Summary: The Count-Min Sketch and its Applications. Preprint submitted to Elsevier Science, December 2003. http://bit.ly/2HSmSPe.

  • [Domingos2000] Domingos, Pedro, and Geoff Hulten. “Mining High-Speed Data Streams.” Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2000). http://bit.ly/315nSqH.

  • [Dunning2013] Dunning, Ted, and Otmar Erti. “Computing Extremely Accurate Quantiles Using t-Digests.” http://bit.ly/2IlpZhs.

  • [Flajolet2007] Flajolet, Philippe, Éric Fusy, Olivier Gandouet, and Frédéric Meunier. “HyperLogLog: The Analysis of a Near-Optimal Cardinality Estimation Algorithm,” Discrete Mathematics and Theoretical Computer ...

Get Stream Processing with Apache Spark now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial