Seminar "Query Processing"

Organization

• The first meeting and the assignment of the talks took place on Tuesday, April 17th. All available topics have been assigned.
  
• Regular meetings are on Tuesdays at 14 c.t. in room 433 (rotunda 4th floor), building E1.4. Note that the room has changed! There are a few meetings with two talks that start at 14:00 s.t.!
  
• Prerequisite for attending the seminar is some knowledge of databases in general. We recommend that participants have successfully participated either in the basic course "Informationssysteme", in the course "Database Systems", or in the course "Query Optimization" in the previous semester.
• A good general introduction to query processing is
  Goetz Graefe: Query evaluation techniques for large databases. ACM Computing Surveys 25(2), pp. 73-170, 1993.
  We expect that every participant has read and understood this survey before May 8th.
  
• We checked that all papers are available from the MPI-INF network (last check: April 17, 2007, 1pm). If you encounter any problems accessing a paper, please contact us, we'll send you the file(s) by email.

Contents of the Seminar

Requirements for the Certificate

• Attend all talks - not just your own. We will keep track of participation! If you are sick, please let us know in advance by writing a short mail.
• Read your paper and other related literature
• Prepare a 45 minutes talk about your topic that introduces the matter to your fellow students. You must send your slides to and discuss them with your tutor by the Friday before your talk at the latest, otherwise your talk will be cancelled. Both the slides and the presentation itself must be given in English. Otherwise, some students will not be able to follow all talks, which is one of the main purposes of the seminar. After the presentations, there will be a discussion in which all fellow students are encouraged to ask questions. We will keep track of your participation (i.e., if you ask questions) and, of course, the answers of the presenter.
• One week after your talk, you have to submit a short (up to 10 pages) summary of your talk's topic, possibly pointing out strengths and weaknesses of the approach presented in the paper that you discovered while preparing your talk.
  
• In other words: Your final grade will be influenced by the following components: Your oral presentation, the knowledge about your topic (your answers to questions after the presentation), your general participation in the seminar, and your written summary of your talks topic.

Schedule

"Classic" query processing

• Tuesday, May 8, 2007, 14:15: *** CANCELLED ***
  R. Avnur, J. M. Hellerstein: Eddies: Continuously Adaptive Query Processing. SIGMOD Conference, pp. 261-272, 2000.
• Tuesday, May 15, 2007, 14:00: Carlos Figueredo (tutor is Thomas Neumann)
  G. Luo, J.F. Naughton, C.J. Ellmann, M.W. Watzke. Increasing the Accuracy and Coverage of SQL Progress Indicators. Int. Conf. on Data Engineering (ICDE'05), pp. 853-864, 2005.
• Tuesday, May 15, 2007, 15:00: Jonathan Osthof (tutor is Thomas Neumann)
  C. Jermaine, A. Dobra, S. Arumugam, S. Joshi, A. Pol: A Disk-Based Join With Probabilistic Guarantees. SIGMOD Conference, pp. 563-574, 2005.
  
• Tuesday, May 22, 2007, 14:15: *** CANCELLED ***
  V. Raman, G. Swart: How to Wring a Table Dry: Entropy Compression of Relations and Querying of Compressed Relations. Int. Conference on Very Large Data Bases (VLDB), pp. 858-869, 2006.

Top-k query processing

• Tuesday, May 29, 2007, 14:00: Levan Kasradze (tutor is Josiane Parreira)
  Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas, Sumin Song: RankSQL: Query Algebra and Optimization for Relational Top-k Queries. SIGMOD Confereence, pp. 131-142, 2005.
• Tuesday, May 29, 2007, 15:00: Stefan Holder (tutor is Josiane Parreira)
  I. Ilyas, W. Aref, A. Elmagarmid: Supporting top-k join queries in relational databases. VLDB Journal 13(3), pp. 207-221, 2004.
• Tuesday, June 5, 2007, 14:15: David Philippi (tutor is Andreas Broschart)
  Michael J. Carey, Donald Kossmann: Reducing the Braking Distance of an SQL Query Engine. Int. Conf. on Very Large Data Bases (VLDB), pp. 158-169, 1998.
• Tuesday, June 19, 2007, 14:15: Arndt Faulhaber (tutor is Andreas Broschart)
  Yi Luo, Xuemin Lin, Wei Wang, Xiaofang Zhou: SPARK: Top-k Keyword Query in Relational Databases. SIGMOD Conference, 2007.

Distributed and P2P query processing

• Tuesday, June 26, 2007, 14:00: *** CANCELLED ***
  Ryan Huebsch, Brent N. Chun, Joseph M. Hellerstein, Boon Thau Loo, Petros Maniatis, Timothy Roscoe, Scott Shenker, Ion Stoica, Aydan R. Yumerefendi: The Architecture of PIER: an Internet-Scale Query Processor. Conf. on Innovative Data Research (CIDR), pp. 28-43, 2005.
• Tuesday, July 3, 2007, 14:00: Cathrin Weiß (tutor is Sebastian Michel)
  Jiangong Zhang, Torsten Suel: Efficient Query Evaluation on Large Textual Collections in a Peer-to-Peer Environment. Int. Conf. on Peer-to-Peer Computing, pp. 225-233, 2005.
• Tuesday, July 3, 2007, 15:00: Laura Andreescu (tutor is Sebastian Michel)
  Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu: Finding global icebergs over distributed data sets. Principles of Database Systems (PODS), pp. 298-307, 2006.

Query Processing in nonrelational systems

• Tuesday, July 10, 2007, 14:00: Martin Schreiber (tutor is Ralf Schenkel)
  Yen-Yu Chen, Torsten Suel, Alexander Markowetz: Efficient query processing in geographic web search engines. SIGMOD Conference, pp. 277-288, 2006.
• Tuesday, July 10, 2007, 15:00: Roxana Ragneala (tutor is Klaus Berberich)
  Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang: Progressive and Selective Merge : Computing Top-K with Ad-hoc Ranking. SIGMOD Conference, 2007.
• Tuesday, July 17, 2007, 14:15: Adrian Villwock (tutor is Ralf Schenkel)
  Christian Mathis, Theo Härder, Michael Peter Haustein: Locking-aware structural join operators for XML query processing. SIGMOD Conference, pp. 467-478, 2006.