initialized by constructor call can be const and may also be easier to use with standard containers or algorithms. The problems with doing work in constructors are: • If the work calls virtual functions, these correct exception-safe code easy. Further, to avoid requiring readers to understand the entire call graph, exception-safe code must isolate logic that writes to persistent state into a “commit” phase. This Lambdas are much more concise than other ways of defining function objects to be passed to STL algorithms, which can be a readability im- provement. • Appropriate use of default captures can remove redundancy

selection needs time  pipeline model  Ex. Compressed Linear Algebra  Problem: Iterative ML algorithms + memory-bandwidth-bound operations  crucial to fit data in memory  automatic lossless compression of Technology, WS 2020/21 Abstract % 1. State the problem Large-scale machine learning (ML) algorithms are often iterative, using repeated read-only data access and I/O-bound matrix-vector multiplications Challenges of Graph Processing. PVLDB 11(4) 2017  #4.3 Yuanyuan Tian, Andrey Balmin, Severin Andreas Corsten, Shirish Tatikonda, John McPherson: From "Think Like a Vertex" to "Think Like a Graph". PVLDB

Archival publications, awareness of peer-review  From right communities (e.g., ML systems vs ML algorithms)  Reputation of website, authors, etc  Recap: Give Credit  Cite broadly, give credit to inspiring … \end{verbatim}  Theorem, Definition, Examples  Refine theorem environments as needed  Algorithms  Can be clearer than text, but not always  Carefully select the right level of abstraction Avoid exclamation marks! Never use more than one!! Scientific Writing When using disk[,] tree algorithms were found to be particularly poor. We use index structures like b-trees, tries, and hash tables;

Visible font sizes (similar to text)  Legends  Order them by appearance  Attach directly to graph Experiments and Result Presentation [I. Manolescu, S/ Manegold: Performance Evaluation in Database