Topics in Database Systems: Topic: Main Memory and Embedded DBMS
CS 848, Waterloo, Spring '18
Instructor: David Toman (firstname.lastname@example.org)
Lectures: Tuesday 03:30-06:20 DC2568
Office: DC 3344, x34777
Class Info: http://cs.uwaterloo.ca/~david/cs848s18/
Summary: The focus of this class is enabling the use of
database (mostly relational) technology in areas that are not well
served by traditional relational implementations, such as Oracle or
DB2. The central theme of the course be centered around conceptual
vs. physical database design issues and will demonstrate how advanced
physical designs can be used in non-traditional settings, such as
main-memory databases and embedded systems. The class also introduces
tools that allow executing queries/updates over such advanced physical
designs with the goal of competing with hand-crafted C code in
Fundamentals of Physical Design and Query Compilation,
David Toman and Grant Weddell, Synthesis Lectures on Data Management, M. Tamer Özsu, Series Editor,
Morgan and Claypool Publishers.
You can get an electronic (pdf) copy of the textbook
for free (while on UW campus network), or a hard-copy if you prefer from Amazon.
Class Schedule and Outlines:
- Week 1 (05/01): Introduction and organization,
Goals (aka why are we here?), and a refresher on relational calculus.
We introduce a case study of applying relational technology in non-traditional setting, such as embedded systems: the
Linux kernel and discuss the desiderata for alternative approaches to relational query
processing; this discussion will yield the goals of the class.
Reading for week 1:
- Week 2 (05/08):
Queries and Plans.
Reading for week 2:
- Week 3 (05/15): Extra-logical Operations and Updates
Extra-logical features: duplicates and cuts,
Reading for week 3:
- Week 4 (05/22): Monday schedule (have to teach another class)
- Week 5 (05/29):
Querying Databases through Ontologies: the "open world" case.
The presentation will consider an alternative to query rewriting
(equivalence under constraints): the computation of certain
answers. It will introduce the approach and discuss its
computational price in terms of how powerful query and constraint
languages are used. It will show that such an approach is
computationally feasible for only relatively weak languages. It
will then discuss the possibility of generating certain answer
based on first-order rewritability in such a setting, i.e., for
conjunctive queries over ontologies formulated in families of
suitably restricted description logics, such as ELH and DL-Lite.
Reading for week 5:
- Week 6 (06/05):
Query Compilation: Interpolation
Reading for week 6:
- Weeks 7-12 (06/19-07/17): Presentations/Projects
- Week 13 (07/24): Summary and wrap-up.
Projects: Preferred projects will be related to applying
(some) of the ideas presented in this class to your own area of
research: this can further your own research and may help you to
consider alternative views/approaches to what you have been thinking
- project proposal: one page due at the latest on 06/12 (week 7) in class;
- project presentation: 20-30 minutes in weeks 10-12(-13);
- report (in pdf, up to 10 pages), source code (if applicable)
If you don't see any relation to your own research, here are
a few alternative options.