Algorithms for Database Systems (Seminar)

News

Overview and Objectives

The theme of the seminar this year is Big Data. The seminar will address various topics in this area: Systems, Algorithms, and Applications.

Students learn how to critically read and study research papers, how to summarize the contents of a paper, and how to present it in a seminar.

Teaching Format

Each participant writes a self-contained report of about 10 pages (single-column is fine) and gives a 30 minute presentation. This year, all presentations will be at the blackboard only. (No computers; no powerpoint!) 

Each participant is associated to another participant who serves as a shepherd (aka buddy) for report and presentation. Buddies read the report, make suggestions for improvements, and help with the presentation (e.g., dry runs). 

The first version of the report is due two weeks before the date of the presentation. (No excuses!) This first version of the report and presentation will be discussed with the buddy and a professor one week before the presentation. The final versions of the report are due at the end of the semester.

Grading will depend on the quality of the report, talk, active participation during the seminar, and impact as a shepherd.

Setup and Organization

The setup of the seminar will be discussed on on Tuesday, February 18, from 14 - 16 h in room CAB H 52. In this meeting, the seminar topics will be presented and assigned to participants.  The seminar talks will be given in two blocks on two Saturdays: April 12 and May 10. Participation on both Saturdays is mandatory.

First Presentation:

On Saturday (April 12), we will have the first session of our seminar.  There will be eight talks (each about 30 minutes).  The coordinates are: 

  Location:  CAB H52
  Starting Time:  8:15 am (sharp)

Since the building will be locked, we shall meet at 8:00 am at the back entrance of the CAB building.  (The back entrance is the entrance facing the Sternwarte, the ASV entrance, and just at the other side of the main entrance.)  Please, be on time so that we can start on time.

Second Presentation:

Saturday, May 10 the second session of our seminar takes place.

Location: BIN 2.A.01 (ifi, Binzmühlestrasse 14, Oerlikon)
Starting Time: 8:15

The building is locked and we meet at 8:05am at the front entrance
(roughly in the middle between tram stops Bahnhof Oerlikon Ost and Leutschenbach) 

Schedule:

Paper Date Professor/ Post-doc Presenter Buddy
(1) PEGASUS: A Peta-Scale Graph Mining Sytem - Implementation and Observations April 12  Michael Böhlen  Hany Medhat Mohamed Abdelrhman Katerina Papaioannou
(2) HaLoop: Efficient Iterative Data Processing on Large Clusters April 12   Donald Kossmann  Andreas Erich Allenspach Lucas Jacques
(3) Pregel: A System for Large-Scale Graph Processing April 12 Peter Widmayer  Tatjana Brulisauer Animesh Kumar Trivedi
(4) SystemML: Declarative Machine Learning on MapReduce April 12 Arijit Khan  Jessica Patricia Falk Bogdan Aurel Vancea
(5) Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud April 12 Michael Böhlen  Jannick Marc Griner Severin Lukas Munger
(6) GraphChi: Large-Scale Graph Computation on Just a PC April 12 Arijit Khan  Robin Guldener Marc Andre Tanner
(7) X-Stream: Edge-Centric Graph Processing using Streaming Partitions April 12 Arijit Khan  Yassin Nasir Hassan  Stefan Mogenthaler
(8) From "Think Like a Vertex" to "Think Like a Graph" April 12 Donald Kossmann Benz Schenk Urs Florian Muller
(9) Fast Nearest-neighbor Search in Disk Resident Graphs April 12 Peter Widmayer  
(10) Asynchronous LargeScale Graph Processing Made Easy May 10 Arijit Khan   
(11) GBASE: A Scalable and General Graph Management System May 10 Michael Böhlen  Stefan Mogenthaler Benz Schenk
(12) GSPARQL: A Hybrid Engine for Querying Large Attributed Graphs May 10 Michael Böhlen  Urs Florian Muller Robin Guldener
(13) Managing Large Dynamic Graphs Efficiently May 10 Donald Kossmann  Severin Lukas Munger Yassin Nasir Hassan
(14) Cache Oblivious Priority Queue and Graph Algorithm Applications May 10 Peter Widmayer  Marc Andre Tanner  Jannick Marc Griner
(15) Trinity: A Distributed Graph Engine on a Memory Cloud May 10 Arijit Khan  Animesh Kumar Trivedi  Jessica Patricia Falk
(16) F1: A Distributed SQL Database that Scales May 10 Donald Kossmann  Bogdan Aurel Vancea Tatjana Brulisauer
(17) Online Asynchronous Schema Change in F1 May 10 Donald Kossmann Katerina Papaioannou  Andreas Erich Allenspach
(18) Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach May 10 Peter Widmayer Lucas Jacques Hany Medhat Mohamed Abdelrhman

  

 

Language

All reports must be written in English. All talks must be in English.

Organisation

Donald Kossmann (ETH)Peter Widmayer (ETH), Michael Böhlen, (UZH)