Seminar in Databases (SDB)
| Academic Year: | 2011/12, Winter semester |
| Lecturer: | Johann Gamper |
| Lectures: | TU 14:00-16:00, Room E412 |
| Labs: | TU 16:00-17:00, Room E412 |
| Office hours: | TU and TH 09:00-10:00 or by prior arrangement via email |
Objectives: The overall objective of this seminar is to study and discuss advanced technologies in database systems. This year's edition will mainly concentrate on advanced query processing in network databases. The didactic objective of the course is to train students to critically read and study a research paper. Students will also learn how to summarize the contents of a paper and how to present it in a seminar.
Prerequisites: Students should have a solid mathematical foundation and be familiar with the basic concepts in databases and database management systems. Some basic knowledge in spatial and network databases is helpful. These prerequisites are covered in the following courses: Analysis, Probability Theory and Statistics, Introduction to Databases, Data Management Systems, Data Structures and Algorithms.
Syllabus: The papers that will be selected for the seminar cover various aspects of spatial network databases, including
- Shortest path, Nearest Neighbor, Range, Isochrone, Optimal Location queries
- Sequenced spatio-temporal aggregation
- Querying time-dependent and schedule-based networks
- Approximate solutions using landmarks
- etc.
Teaching format: The course is organized as a series of seminars, given by the students. Each seminar consists of the presentation of a scientific paper followed by a discussion. In the first week students can bid for papers. Each student get assigned one or two papers, depending on the number of students. The teacher will assist extensively students in studying the papers, including the most relevant related work, and in preparing the presentation.
Reading list: The following research papers will be used in the seminar:
- D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query processing in spatial network databases. In Proc. of VLDB-2003. [pdf]
- K. Deng, X. Zhou, H. T. Shen, S. W. Sadiq, and X. Li. Instance optimal query processing in spatial networks. In The VLDB Journal, 2009. [pdf]
- E. Kanoulas, Y. Du, T. Xia, and D. Zhang. Finding fastest paths on a road network with speed patterns. In Proc. of ICDE-2006. [pdf]
- B. Ding, J. X. Yu, and L. Qin. Finding time-dependent shortest paths over large graphs. In Proc. of EDBT-2008. [pdf]
- K. Mouratidis, M. L. Yiu, D. Papadias, and N. Mamoulis. Continuous nearest neighbor monitoring in road networks. In Proc. of VLDB-2006. [pdf]
- H. Samet, J. Sankaranarayanan, and H. Alborzi. Scalable network distance browsing in spatial databases. In Proc. of SIGMOD-2008. [pdf]
- K. Mouratidis, Y. Lin, and M.L. Yiu. Preference queries in large multi-cost transportation networks. In Proc. of ICDE-2010. [pdf]
- R. Jin, Y. Xiang, N. Ruan, and H. Wang. Efficiently answering reachability queries on very large directed graphs. In Proc. of SIGMOD-2008. [pdf]
- X. Xiao, B. Yao, and Feifei Li. Optimal location queries in road network databases. In Proc. of ICDE-2011. [pdf]
- V. Balasubramanian, D.V. Kalashnikov, S. Mehrotra, and N. Venkatasubramanian. Efficient and scalable multi-geography route planning. In Proc. of EDBT-2010. [pdf]
Learning outcome: Students completing this course should know some state of the art research results in the field of temporal databases; be able to read and understand a scientific paper describing advanced database technologies; be able to investigate a research problem and search for additional information when the paper is not self contained; be able to present and explain the complex content of a research paper to an audience.
Schedule
Lectures
| 1. | TU 04.10.11 | General introduction, syllabus, administration and organisation, short presentation of research papers | [pdf] |
| 2. | TU 11.10.11 | Assignment of papers; introduction to spatial databases | [pdf] |
| 3. | TU 18.10.11 | Isochrones in multimodal networks | [pdf] |
| 4. | TU 08.11.11 | Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs | [pdf] |
| 5. | TU 15.11.11 | Manfred Malleier: Efficiently Answering Reachability Queries on Very Large Directed Graphs (R. Jin, Y. Xiang, N. Ruan, and H. Wang) | [pdf] |
| 6. | TU 22.11.11 | Ondrej Platek: Instance optimal query processing in spatial networks (Deng et al. 2009) | [pdf] |
| 7. | TU 29.11.11 | Khanna Ankur: Query Processing in Spatial Network Databases. (D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao) | [pdf] |
| 8. | TU 06.12.11 | Rodrique Djonkou: Finding time-dependent shortest paths over large graphs. (B. Ding, J. X. Yu, and L. Qin) | [pdf] |
| 9. | TU 13.12.11 | Johannes Erschbamer: Continuous nearest neighbor monitoring in road networks. (K. Mouratidis, M. L. Yiu, D. Papadias, and N. Mamoulis) | [pdf] |
| 10. | TU 20.12.11 |
Khanna Ankur: Query Processing in Spatial Network
Databases. (D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao) Rodrique Djonkou: Finding time-dependent shortest paths over large graphs. (B. Ding, J. X. Yu, and L. Qin) |
[pdf, pdf] |
| 11. | TU 10.01.12 | Markus Innerebner: MIERWINE - A Disk-based Loading Strategy for Multimodal Network Range Queries | |
| 12. | FR 20.01.12 | Bridget Ohenhen: Scalable network distance browsing in spatial databases. (H. Samet, J. Sankaranarayanan, and H. Alborzi) |
