Andrew. Graph stream algorithms: a survey. ACM SIGMOD Record 43.1 (2014). https://dl.acm.org/doi/pdf/10.1145/2627692.2627694 • Stanton, Isabelle, and Gabriel Kliot. Streaming graph partitioning for SIGKDD, 2012. https://www.microsoft.com/en-us/ research/wp-content/uploads/2012/08/kdd325-stanton.pdf • Stefani, Lorenzo De, et al. Triest: Counting local and global triangles in fully dynamic streams streams with fixed memory size. TKDD 2017. https://www.kdd.org/ kdd2016/papers/files/rfp0465-de-stefaniA.pdf Further reading

edu/cs286/papers/synopses- fntdb2012.pdf • Jure Lescovec, Anand Rajaraman and Jeffrey David Ullman. Mining of Massive Datasets. http://infolab.stanford.edu/~ullman/mmds/book.pdf • Ken Christensen, Allen Roginsky

Jeffrey David Ullman. Mining of Massive Datasets. http://infolab.stanford.edu/~ullman/mmds/book.pdf • Durand, Marianne, and Philippe Flajolet. Loglog counting of large cardinalities. European Symposium estimation algorithm. 2007. https://hal.archives-ouvertes.fr/file/index/docid/406166/ filename/FlFuGaMe07.pdf • Cormode, Graham, and Shan Muthukrishnan. An improved data stream summary: the count-min sketch

reading • The 8 Requirements of Real-Time Stream Processing
 http://cs.brown.edu/~ugur/8rulesSigRec.pdf • Streaming 101: The world beyond batch
 www.oreilly.com/ideas/the-world-beyond-batch-streaming-101

Distributed Stream Processing. (ICDE ’05). • http://cs.brown.edu/research/aurora/hwang.icde05.ha.pdf • Tyler Akidau et. al. MillWheel: Fault-Tolerant Stream Processing at Internet Scale (PVLDB’13)