Instructors
Prof. Dr. Tilmann Rabl, Nils Straßenburg, Ricardo Salazar
Description
The amount of data that can be generated and stored in academic and industrial projects and applications is increasing rapidly. Big data analytics technologies have established themselves as a solution for big data challenges to the scalability problems of traditional database systems. The vast amounts of new data that is collected, however, usually is not as easily analyzed as curated, structured data in a data warehouse is. Typically, these data are noisy, of varying format and velocity, and need to be analyzed with techniques from statistics and machine learning rather than pure SQL-like aggregations and drill-downs. Moreover, the results of the analyzes frequently are models that are used for decision making and prediction. The complete process of big data analysis is described as a pipeline, which includes data recording, cleaning, integration, modeling, and interpretation.
In this lecture, we will discuss big data systems, i.e., the infrastructures that are used to handle all steps in typical big data processing pipelines.
Literature
- Principles of Distributed Database Systems , M. Tamer Özsu and P. Valduriez, 2011, 978-1441988331
- Distributed Systems , Maarten van Steen and Andrew S. Tanenbaum, 2017, 978-1543057386
- Streaming Systems , T. Akidau, S. Chernyak, R. Lax, 2018, 978-1-491-98387-4
- Designing Data-Intensive Applications , M. Kleppmann, 2017, 978-1449373320
Announcements
- The introductory lecture will also be streamed live, Zoom link is available in Moodle
- Course management will be done using the HPI Moodle
- The lectures will be held on-site at HPI
- Non-HPI participants : please send us an email to get access to the Moodle
- All lectures are recorded and available in Tele-Task
Schedule (tentative)
The lectures will be held on Tuesdays (L-E.03) and Wednesdays (L-E.03) at 11:00 to 12:30 h.
| Date | Topic Tuesday | Topic Wednesday |
| 17.10. /18.10 | Intro / Organizational | Intro to Programming Exercise I |
| 24.10. / 25.10. | Use Case - Search Engines | Performance Management |
| 31.10. / 1.11. | Map Reduce I | Exercise |
| 7.11. / 8.11. | Map Reduce II | Map Reduce III |
| 14.11. / 15.11. verlegt in L-1.02 | Data Center / Cloud | Exercise |
| 21.11 / 22.11. | File Systems | Key Value Stores I |
| 28.11. / 29.11. | Key Value Stores II | Exercise |
| 5.12 / 6.12. | Key Value Stores III | Key Value Stores IV |
| 12.12. / 13.12. | Stream Processing I | Exercise |
| 19.12. / 20.12. | Stream Processing II | Stream Processing III |
| 9.1./ 10.1. | ML Systems I | Exercise |
| 16.1. / 17.1. | ML Systems II | ML Systems III |
| 23.1. / 24.1. | Modern Hardware I | Exercise |
| 30.1. / 31.1. | Modern Hardware II | Industry Talk |
| 6.2. / 7.2. | Exam Prep | Exam |
Grading
The grade will be determined by an exam. The time and location of the exam will be anounced at least 6 weeks in advance. The prerequisite for admission to the exam is the successful completion of the exercises. In case of low participation, the exam might be replaced by an oral examination.
The grade breakdown is as follows:
- 3 graded programming exercies (pass all for exam eligibility)
- 4 graded quizzes (50% in all quizzes for exam eligibility)
- Final Exam (100% of the grade)
- (If you want yo withdraw from the exam, you have to do so at least 8 days before the exam date.)
