Algorithms for massive datasets

MSc in Computer science (Università degli Studi di Milano)

Other academic years

The course aims at describing the big data processing framework, both in terms of methodologies and technologies.

Expected results

Students:

• will be able to use technologies for the distributed storage of datasets;
• will know the MapReduce distributed processing framework and its leading extensions;
• will know the principal algorithms used in order to deal with classical big data problems, as well as to implement them using a distributed processing framework;
• will be able to choose appropriate methods for solving big data problems.

News

Language

Lectures are in English.

Course schedule

Lectures take place (until further notice) online through authentication to a zoom link published on the moodle page of the course. The provisional schedule is as follows:

Any change to the schedule will be announced in class and published in paragraph News of this page. The recording of lectures, marked with (R) in the schedule, is available until the end of the course, through access to the corresponding moodle page.

Office hours

By appointment, room 5015 of the Computer Science Department. It is possible contact the teacher by e-mail, taking care to read in advance the guide prepared by Prof. Sebastiano Vigna and clearly specifying in the message the course name and the academic year. In particular, students are encouraged to always use their academic address (i.e. based on the domain studenti.unimi.it) signing with name and student ID number and recalling that the response time may vary depending on the teacher commitments.

Specific, group-based office hours for the course will be organized on a weekly basis, each thursday at 17:30 using the same zoom link of lectures.

Course material

Lectures are based:

• on the textbook Mining of Massive Datasets, written by A. Rajaraman and J. Ullman (marked by RU in the calendar of lectures), available as a free download in the authors' Web site and published in hardcopy by Cambridge University Press (ISBN:9781107015357);
• on the notes and sample code published in the calendar of lectures.

Syllabus

The course explains the topics listed in the lecture calendar (available at the beginning of the course), covering the textbook contents as well as the contents of the remaining documents listed in Course material.

Prereqs

The course requires knowledge of the main topics of bachelor-level computer programming, calculus, probability, and statistics.

Lectures calendar

Exam modalities

The exam consists of a project and an oral test, both related to the topics covered in the course. The project requires to process one or more datasets through the critical application of the techniques described during the classes, and is described in a written report. The evaluation of the project, expressed with a pass/fail mark, considers the level of mastery of the topics and the clarity of the report. The oral test, which is accessed after a positive evaluation of the project, is based on the discussion of some topics covered in the course and on in-depth questions about the presented project. The evaluation of the oral test, expressed on a scale between 0 and 30, takes into account the level of mastery of the topics, clarity, and language skills.

Exam sessions