
COMP 5118
Fall 2025
Course Overview
Welcome to COMP 5118! This is a graduate-level course for students at Carleton University and the University of Ottawa. Each year, we focus on cutting-edge research topics in the general field of data management. These topics change from one offering to another depending on what's new and hot.
This term, we will explore a variety of exciting areas that represent the forefront of data management research. This will give you a strong understanding of what the research community is currently working on and hopefully inspire ideas for your course project, which you should take very seriously.
This Semester's Topics Include:
- Knowledge Graphs
- Geospatial Data
- LLM-Applications
- Time Series
- Healthcare Analytics
- Natural Language to SQL
- Data Cleaning
- Data Lakes
- Efficiency
- Entity Alignment
Grading Scheme
In this course, students will be reading and reviewing papers for each class. During the class, some students will present the papers for the week, and we will all discuss them. There is also a term-long project, which is worth the biggest chunk of your grade.
- Project 45%
- Presentations 20%
- Paper Reviews 20%
- Class Participation 15%
Project (45%)
The project can be done individually or in groups (assessment will consider group size) and can be one of the following types:
- New Research Idea: A prototype implementation of a new research idea that addresses a limitation in existing work or is a completely new idea inspired by your readings.
- Experimental Study: A comprehensive experimental comparison and evaluation of existing work on a specific topic. The goal is to provide new insights not present in the original papers.
- Survey: A paper that summarizes, categorizes, and provides new insights on a major research area. See this good example.
- System Implementation & Reproducibility: Implement and reproduce the results of a system from a published paper. I have a number of systems in mind.
Project Deliverables:
- Project Proposal: Max 2 pages in ACM Format (LaTeX mandatory). Due: October 27 at 11:59 PM. Early submissions are STRONGLY encouraged. Submit via this form.
- Project Paper: Min 7 pages in ACM Format. Due: December 8 at 11:59 PM (hard deadline for late submissions: Dec 15). Submit via this form.
- Source Code: Publicly available on GitHub with a good README. Link must be in the project paper.
Presentations (20%)
Each presentation should be 30-45 minutes, followed by a 30-45 minute discussion. The presenter is responsible for leading the discussion.
Paper Reviews (20%)
Reviews are due at 11:00 AM on the day of the class via the Paper Review Submission Link. Format: Summary, 3+ strong points, 3+ weak points, and additional comments. Your two worst reviews will be dropped.
How to Write a Good Review:References: Reading a CS Paper, How to Read a Paper, and a real-world sample review.
- Do not copy/paste from the paper. Use your own words.
- Enumerate strong and weak points; do not write one large paragraph.
- Justify your points. Why is a deep learning approach good *in this specific case*?
- Elaborate! "Using templates" is not a strong point on its own. Explain why it is effective.
- Focus on the technical substance, not just the writing style.
- Avoid stating the obvious as a strong point (e.g., "they beat the state-of-the-art").
Class Participation (15%)
This is a seminar-based class, meaning that your participation is essential. You are encouraged to ask questions, answer other students' questions, and give comments on the papers we discuss.
Papers List
Course Schedule
Date | Topics | Papers | Speakers |
---|---|---|---|
Sep 9 | Course Introduction | N/A | Ahmed El-Roby |
Sep 16 | Graph Processing Natural Language to SQL |
1. TBD. 2. TBD. |
|
Sep 23 | TBD |
|
1. TBD. 2. TBD. |
Sep 30 | TBD |
|
1. TBD. 2. TBD. |
Oct 7 | TBD |
|
1. TBD. 2. TBD. |
Oct 14 | TBD |
|
1. TBD. 2. TBD. |
Oct 21 | NO CLASS (Fall Break) | ||
Oct 28 | TBD |
|
1. TBD. 2. TBD. |
Nov 4 | TBD |
|
1. TBD. 2. TBD. |
Nov 11 | TBD |
|
1. TBD. 2. TBD. |
Nov 18 | TBD |
|
1. TBD. 2. TBD. |
Nov 25 | TBD |
|
1. TBD. 2. TBD. |
Dec 2 | TBD |
|
1. TBD. 2. TBD. |