Seminar SS 16

Important information (Seminar WS16/17)

The website of the upcoming seminar has been moved to

If you would like to register for the seminar in winter term 2016/17, please use the link above.

The registration due is September 30.

"Those Oldies But Goodies" - DB Classics (Seminar SS16)

In this term's seminar, we will look into classic database research work in old times.
Weiping Qu

Presentations Schedule

Monday, July 25, 2016


Efficient query evaluation on probabilistic databases

Nikhila Maddipatla


Integration of heterogeneous databases without common domains using queries based on textual similarity

Shraddha Gupta

lunch break


View maintainence in a warehousing environment

Tanvi Gupta


Querying heterogeneous information sources using source descriptions

Michael Hohenstein

Tuesday, July 26, 2016


Optimising queries using materialized views: a practical, scalable solution

Dipesh Dangol


Online aggregation

Harshith Subramanya

lunch break


A critique of ANSI SQL isolation levels

Raees Khan


Main memory database systems: an overview

Rishabh Goswami


Database architecture optimized for the new bottleneck: memory access

Roshni Roshni





September 12, 2016

Seminar ss16 results


The results can be found here.


May 4, 2016

Final seminar dates


The final seminar dates are July 25 & 26. The attendence of all the talks is mandatory!


April 21, 2016

Seminar starts!


The slides for Kick-off can be found here.


April 1, 2016

Registration for Seminar SS16 is over


The results will be notified and topics will be available latest on April 8.


March 20, 2016

Results of Seminar WS 15/16


You can find your final results here.


Feb. 29, 2016

Registration for DB Seminar SS 2016


You can sign-up for the seminar in summer term through this link until March 31, 2016.

The result of registration will be informed after registration deadline.

Kick-off meeting will be held on April 20 (Wednesday) at 14:00 in 36/336.


The attendence of the kick-off meeting is mandatory!


Feb. 22, 2016

Related Info. of Seminar WS 15/16


Old news for students who attended seminar ws 15/16 can be found under this link.



Participants should have successfully attended the lecture Datenbankanwendung(database application) or equivalent. Further, having attended the core course Informationsysteme(information system) is recommended, too.

Requirements for Certificate



Time period


before Kick-off



- March 31: end of registration

- April 1 ~ April 17:

* registration result notification

* collection of preferences on assigned topics from students

* topic assignment notification


will take place on April 20 (Wednesday) and the attendance is mandatory.

Seminar starts!

Our seminar provides students with a place where assigned readings are discussed, questions can be raised and debates can be conducted.

In general, each participant has to construct presentation slides, give a talk and submit a report, especially join the discussion.

Hence, the attendance of all the final presentations is mandatory.

The performance, i.e. final grade of your seminar work is derived from the following aspects:

- active participation in final discussion

- quality of your talk incl. slides, Q&A

- understanding on your topic incl. basic theory and paper-specific idea/algorithm

- active participation during entire seminar, i.e. participation in review & moderation phases

Kick-off ~ May 20

Understanding seminar paper:


The first month is used to read and understand the assigned seminar paper.


Each student has to make a first appointment with your tutor to discuss the outline of your presentation. There is no need to have slides ready; but be able to have a solid understanding of the paper and concrete ideas (e.g., bullet point list) how you want to organize the talk. You are responsible for scheduling meetings with your tutor.


Meanwhile, each student prepares a short written summary of around 5000-5500 characters (incl. whitespace) as an introduction to relevant foundations of your seminar paper. It should address the list of questions/hints put below.

- What is the research field of the paper, e.g., query optimization in database systems, graph data mining, social network analysis, or index structures?

- What is the motivation of the paper, i.e., why are the results presented in the paper useful?

- What does the paper propose? A new system, algorithms, theory, experimental evaluation, or any subset of these?

- More specifically, what is the main idea of the paper? For instance, it proposes an algorithm to allow efficient search in high-dimensional data.

- What other work exists and how do the authors put their work apart from existing papers on a high level? List 2-3 papers and read (at least) their abstracts.

- Describe three things you like about the paper and three things you dislike.

- What questions would you ask the authors if they were available for a discussion?


This summary is to be sent to the tutor at least 2 days before the first meeting. The idea is that this summary is going to be used as the basis for discussions, for the preparation of the talk, and eventually also as the basis for the final report.


In addition to these generic questions, the tutor will provide additional 3-5 questions that are specific to the paper.

May 21 ~ June 20

Slides preparation:


Point out advantages or potential weaknesses of the work covered in your presentation. If you are unsure about what to present, talk to your tutor. Note that—even though relevant presentations may be available on the web—we expect that you prepare your own slides (which may be, of course, inspired by the original slides).


Send your as-complete-as-possible (i.e., no left TODOs, etc.) slides to and discuss them with your tutor and also your future peer reviewer as well (explained in next part). Otherwise, your talk may be canceled.

June 21 ~ July 15

Review process:


The review process consists of two parts.


The first part is called peer review. Your slides will be reviewed by an arbitarily selected peer student who also participates in seminar in this term. In turn you should review another student's slides and give feedbacks to him/her on his/her work. Peer-to-peer relationships are randomly selected by us.

Meanwhile, your tutor will give you professional feedbacks on your no-left-TODO slides.

By merging feedbacks from both your peer student and your tutor, you should construct a final version of your presentation slides before your talk.

July 18 ~ 29

Final presentation week:

(Final presentation days can be selected in this period and be fixed before Kick-off.)


The 45-min talk should be a mixture (e.g., 20:80) of an introduction to relevant foundations and the details of the paper. If two or more papers have identical or highly related foundations, the introductory talk is shared among the students.


Each presentation is followed by approximately 15 minutes of discussion. The discussion is moderated by your peer student. The moderator's role is to provide interesting input (such as observations, questions, related work) for the discussion and, in general, to enable a constructive discussion.


After seminar, the final slides should be collected.

~ August 5

Completing report:


Extend the previous written summary to a short report (not longer than 4 pages) about your topic. A Latex template and its preview are provided. The report should concisely summarize the article and point out strengths and weaknesses.


You will be assigned one of the below topics, do a literature review, and write a seminar report either in German or English. You will present your results in a 45-minute talk.

Assigned Papers

Paper 1

Berenson, Hal, Phil Bernstein, Jim Gray, Jim Melton, Elizabeth O'Neil, and Patrick O'Neil.

"A Critique of ANSI SQL Isolation Levels."

In ACM SIGMOD Record, vol. 24, no. 2, pp. 1-10. ACM, 1995.

Paper 2

Weber, Roger, Hans-Jörg Schek, and Stephen Blott.

"A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces."

In VLDB, vol. 98, pp. 194-205. 1998.

Paper 3

Chaudhuri, Surajit, and Vivek R. Narasayya.

"An Efficient, Cost-Driven Index Selection Tool for Microsoft SQL Server."

In VLDB, vol. 97, pp. 146-155. 1997.

Paper 4

Vitter, Jeffrey Scott, and Min Wang.

"Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets."

In ACM SIGMOD Record, vol. 28, no. 2, pp. 193-204. ACM, 1999.

Paper 5

Boncz, Peter A., Stefan Manegold, and Martin L. Kersten.

"Database Architecture Optimized for the New Bottleneck: Memory Access."

In VLDB, vol. 99, pp. 54-65. 1999.

Paper 6

Dalvi, Nilesh, and Dan Suciu.

"Efficient Query Evaluation on Probabilistic Databases."

The VLDB Journal 16, no. 4 (2007): 523-544.

Paper 7

Cohen, William W.

"Integration of Heterogeneous Databases without Common Domains using Queries based on Textual Similarity."

In ACM SIGMOD Record, vol. 27, no. 2, pp. 201-212. ACM, 1998.

Paper 8

Garcia-Molina, Hector, and Kenneth Salem.

"Main Memory Database Systems: An Overview."

Knowledge and Data Engineering, IEEE Transactions on 4, no. 6 (1992): 509-516.

Paper 9

Hellerstein, Joseph M., Peter J. Haas, and Helen J. Wang.

"Online aggregation."

In ACM SIGMOD Record, vol. 26, no. 2, pp. 171-182. ACM, 1997.

Paper 10

Goldstein, Jonathan, and Per-Åke Larson.

"Optimizing Queries using Materialized Views: A Practical, Scalable Solution."

In ACM SIGMOD Record, vol. 30, no. 2, pp. 331-342. ACM, 2001.

Paper 11

Rajaraman, Anand, Alon Y. Levy, and J. Ordill Joann.

"Querying Heterogeneous Information Sources using Source Descriptions."

In Proceedings of the 22nd International Conference on Very Large Databases, VLDB-96, Bombay, India. 1996.

Paper 12

Zhuge, Yue, Hector Garcia-Molina, Joachim Hammer, and Jennifer Widom.

"View Maintenance in a Warehousing Environment."

ACM SIGMOD Record 24, no. 2 (1995): 316-327.