Distributed Database Systems DDBS12
| Lecturer: | Michael Böhlen |
| Teaching language: | German or English (English lecture notes, exercises, exam, and text book) |
| Teaching assistant: | Francesco Cafagna |
| Term: | Fall 2012 |
Objectives: The course discusses concepts and techniques for the management of distributed data using distributed database management systems. We consider architecture, database design, query processing, and transaction management for distributed databases.
Teaching format: The course consists of lectures and a course project.
Textbook: The course is based on the book Principles of Distributed Database Systems from Tamer Öszu and Patrick Valduriez, Springer, 3rd edition, 2010. The lecture notes for this course will become available as we progress through the semester.
Course project: In the course project you will implement and evaluate a solution described in one of the papers listed below. The outcome of the course project is a 5 page report that describes problem, solution, algorithm, implementation, and evaluation. The milestones for the course project are: October 3 (plan for implementation with example), November 7 (demonstration of implementation), and December 23 (hand in of report). Please send an email with names and emails of group members and prefered topic to boehlen@ifi.uzh.ch and cafagna@ifi.uzh.ch by Monday October 1, 14:00.
- S. Amer-Yahia, D. Srivastava, D. Suciu, Distributed Evaluation of Network Directory Queries, IEEE Transactions on Knowledge and Data Engineering, vol. 16, nr. 4, pp. 474-486, 2004.
- P. Scheuermann, E. I. Chong, Distributed Join Processing Using Bipartite Graphs, IEEE Distributed Computing Systems, pp. 387-394, 1995.
- L. Michael, W. Nejdl, O. Papapetrou, W. Siberski, Improving distributed join efficiency with extended bloom filter operations, 21st International Conference on Advanced Information Networking and Applications (AINA 2007), pp. 187-194, 2007.
- D. Gao, J. Gendrano, B. Moon, R. Snodgrass, M. Park, B. Huang, and J. Rodrigue, Main memory-based algorithms for efficient parallel aggregation for temporal databases, Distributed and Parallel Databases, vol. 16, pages 123-163, 2004.
Exam The exam is oral and takes place on January 16, 2012 in BIN-E.2.13. In the first part of the exam you have 10 minutes to present and demonstrate your course project. In the second part you will have to answer a question about a selected topic from the course.
Lectures The lectures take place Wednesday 12:15-13:45 in room BIN 1.D.07 and start September 19: The lecture notes for the course will become available as we progress through the semester. Tentative syllabus and slides: