2014). • Ron Avnur and Joseph M. Hellerstein. Eddies: continuously adaptive query processing. (SIGMOD 2000). • Matei Zaharia et. al. Discretized streams: fault-tolerant streaming computation at scale University 2020 54 • Re-ordering • Shivnath Babu et. al. Adaptive Ordering of Pipelined Stream Filters. SIGMOD 2004. • Scheduling and placement • Peter R. Pietzuch et. al. Network-Aware Operator Placement Brian Babcock et. al. Chain : Operator Scheduling for Memory Minimization in Data Stream Systems. SIGMOD 2003. • Donald Carney et. al. Operator Scheduling in a Data Stream Manager. VLDB 2003. • Load

Springer-Verlag, Berlin, Heidelberg. • Lukasz Golab and M. Tamer Özsu. Issues in data stream management. SIGMOD Rec. 32, 2 (June 2003). • David Maier, Jin Li, Peter Tucker, Kristin Tufte, and Vassilis Papadimos Stonebraker, Uǧur Çetintemel, and Stan Zdonik. The 8 requirements of real-time stream processing. SIGMOD Rec. 34, 4 (December 2005).

functions are composed together • E.g., we use a chain to represent f(x) = f3(f2(f1(x))) • If we take sigmod function as the activation function • z1 = w1x + b1 and a1 = σ(z1) • z2 = w2a1 + b2 and a2 = σ(z2)

Vasiliki Kalavri | Boston University 2020 60 • McGregor, Andrew. Graph stream algorithms: a survey. ACM SIGMOD Record 43.1 (2014). https://dl.acm.org/doi/pdf/10.1145/2627692.2627694 • Stanton, Isabelle,