create new tag
view all tags

Big Data Computing

Master's Degree in Computer Science

Academic Year 2016-2017, spring semester

Instructor: Irene Finocchi

Office Hours: by appointment.
Office: Via Salaria, room 345/A. Phone: 06-49918426.
E-mail: finocchi AT di.uniroma1.it

Meeting times and location

Day Time Room
Tuesday 10:00-11:30 Aula Alfa
Thursday 10:00-11:30 Aula Alfa


  • Restricted November session: the restricted exam session (for students who have failed to graduate within the prescribed time; repeating students; part-time students; students workers) will be on November 3, Aula Seminari, 9:30. Please, register for the exam on Infostud if you are entitled to participate.

  • The September exam is postponed to September 8, 9:30, Aula Seminari, third floor. Infostud registrations remain valid.

  • Students who have passed both parts, sent me the homework, and didn't hear back from me about final grade registration on Infostud, please, send me an email with subject "BDC final grade registration" and your names. Thanks.

  • Exam dates: June 8, 9:30, Aula Alfa; June 28, 9:30, Aula Alfa. Registration on Infostud is mandatory (even if you do not plan to complete the exam in a given session or you have already passed one of the two parts).

  • Please, register to the second midterm by May 23 using this link.

  • Software project posted (see Homeworks section below). Deadline: 4 days before your chosen exam session.

Course description

As data sets grow to Terabyte and Petabyte scales, traditional models and paradigms of sequential computation become obsolete. The course will focus on fundamental algorithmic and programming issues posed by big-data computing, tackling some major data mining problems on a variety of computational models used for managing massive information structures. We will study how algorithm design techniques and technological aspects of modern computing platforms interact and adapt to each other. The emphasis will be on:

  • MapReduce as a programming model for distributed data mining on large clusters of computers
  • Data streaming techniques for mining on-the-fly huge and rapidly changing streams of data
  • External memory algorithms for processing data stored on slow secondary memories

The lectures will follow an experimental and problem-driven approach. The goal for the class is to be broad and to touch upon a variety of techniques, introducing standard practices as well as cutting-edge research topics in this area.

Hands-on programming sessions will be held to guide the students on the use of good programming practices and advanced programming frameworks, such as Hadoop. Students will learn the proper settings in which to use each paradigm, the advantages and disadvantages of each model, how to design/analyze algorithms and to write efficient code in different big data settings.

Learning outcomes:

  • Knowledge of big data processing frameworks (part of the Hadoop ecosystem)
  • Knowledge of advanced computational models, focusing on data streaming, MapReduce-style parallelism, external memory
  • Ability to write efficient code taking into account architectural features of modern computing platforms (including distributed systems)
  • Familiarity with data mining problems and techniques
  • Ability to study advanced research topics in big data systems and algorithmics for massive data
  • Performance analysis skills using back-of-the-envelope calculations, mathematical and experimental tools

Lectures and readings

Readings, notes, slides, papers, code... are posted here after each lecture.

There are no required textbooks for this class: many lessons explore cutting-edge topics and there is no unique book covering all of them systematically.

Some resources that we will use along the way are:

  • J. Leskovec, A. Rajaraman, and J. Ullman, Mining of Massive Datasets. Available online.
  • T. White. Hadoop: The Definitive Guide - Storage and Analysis at Internet Scale (4th edition). O'Reilly Media.
  • C. Demetrescu and I. Finocchi. Algorithms for data streams. In Handbook of Applied Algorithms, John Wiley and Sons, 2008
  • K. Mehlhorn, P. Sanders. Algorithms and data structures: The basic toolbox, Springer, 2009. Book web site.



To be updated

  • Programming homeworks assigned during the course.
    You can form groups, up to three persons.
  • Participation to in-class discussions and reading sessions
  • Final written exam

  • Google group

    The group will be used for technical discussions, homework assignment, last-minute messages. Better subscribing!

    Subscribe to Big Data Computing (Sapienza, Irene Finocchi)

    | Email: |

    Visit this group
    Edit | Attach | Watch | Print version | History: r85 < r84 < r83 < r82 < r81 | Backlinks | Raw View | Raw edit | More topic actions
    Topic revision: r85 - 2017-10-31 - IreneFinocchi

    Questo sito usa cookies, usandolo ne accettate la presenza. (CookiePolicy)
    This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2018 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
    Ideas, requests, problems regarding TWiki? Send feedback