home
schedule
assignments
project

Schedule

This is a tentative schedule that will be updated throughout the course.

Lecture Date Topic References Notes
1 Tu 1/22 Introduction introduction
Th 1/24 NO CLASS
2 Tu 1/29 Conjunctive Queries Alice Book: Ch. 3, 4 lecture1
3 Th 1/31 Query Containment Alice Book: Ch. 6.2 lecture2
4 Tu 2/5 Query Containment Alice Book: Ch. 6.2 lecture2
5 Th 2/7 Intro to Query Complexity lecture3
6 Tu 2/12 Acyclic Joins Alice Book: Ch. 6.4 lecture4
7 Th 2/14 Query Decompositions lecture5
7 Tu 2/19 Size Bounds for Joins lecture6
8 Th 2/21 Worst-case Optimal Joins lecture7
9 Tu 2/26 Worst-case Optimal Joins
10 Th 2/28 Datalog: semantics Alice Book: Ch. 12 lecture8
11 Tu 3/5 Datalog: bottom-up evaluation Alice Book: Ch. 13.1 lecture9
12 Th 3/7 Datalog: top-down evaluation Alice Book: Ch. 13.2
13 Tu 3/12 Datalog: magic sets Alice Book: Ch. 13.3
14 Th 3/14 Datalog: negation Alice Book: Ch. 15.1-15.3 lecture10
15 Tu 3/26 Parallel Query Processing lecture11
16 Th 3/28 Parallel Query Processing article
17 Tu 4/2 Data Streaming Paper Review notes (Muthukrishnan)
18 Th 4/4 Data Streaming notes (Chakrabati)
19 Tu 4/9 Probabilistic Databases Paper Review
20 Th 4/11 Probabilistic Databases
21 Tu 4/16 Consistent Query Answering CQA for primary keys
22 Th 4/18 Provenance: Why Paper Review Chapter 2
23 Tu 4/23 Provenance: How Chapter 3
24 Th 4/25 Differential Privacy Paper Review Differential Privacy
Tu 4/30 Project Presentation
Th 5/2 Project Presentation

Paper Reviews

Reading Material


During the first lectures, some of the material will be from the Alice Book:

  • Foundations of Databases, Abiteboul, Hull, Vianu (book).

Some of the papers that we will study throughout the course:

Query Complexity

  • Optimal implementation of conjunctive queries in relational databases, Chandra, Merlin, STOC 1977 (paper)

  • The Complexity of Relational Query Languages, Vardi, STOC 1982 (paper)

  • Algorithms for acyclic database schemes, Yannakakis, VLDB 1981.

  • Size bounds and query plans for relational joins, Atserias, Grohe, Marx, FOCS 2008 (paper)

  • Hypertree Decompositions and Tractable Queries, Gottlob, Leone, Scarcello, JCSS 2002 (paper)

  • Leapfrog Triejoin: a worst-case optimal join algorithm, Veldhuizen, ICDT 2014 (paper)

  • Skew Strikes Back: New Developments in the Theory of Join Algorithms, Ngo, Re, Rudra, SIGMOD RECORD 2013 (paper).

Datalog

  • What You Always Wanted to Know About Datalog(And Never Dared to Ask), Ceri, Gottlob, Tanca, TKDE 1989 (paper)

Parallel Query Processing

  • MapReduce: simplified data processing on large clusters, Dean, Ghemawat, OSDI 2004 (paper)

  • MapReduce and parallel DBMSs: friends or foes?, Stonebraker et al., CACM 2010 (paper)

  • Optimizing Joins in a Map-Reduce Environment, Afrati, Ullman, EDBT 2010 (paper)

  • A Guide to Formal Analysis of Join Processing in Massively Parallel Systems, Koutris, Suciu, SIGMOD Record 2016 (paper)

Data Streaming

  • Models and issues in data stream systems, Babcock, Babu, Datar, Motwani, Widom, PODS 2002 (paper).

  • The space complexity of approximating the frequency moments, Alon, Matias, Szegedy, STOC 1996 (paper).

Uncertain Data

  • Probabilistic Databases, Suciu, Olteanu, Re, Koch (book)

  • Probabilistic Databases: Diamonds in the Dirt, Dalvi, Re, Suciu, CACM 2008 (paper)

  • The dichotomy of probabilistic inference for unions of conjunctive queries, Dalvi, Suciu, JACM 2012 (paper)

  • Consistent Query Answering: Five Easy Pieces, Chomicki, ICDT 2007 (paper)

  • Consistent Query Answers in Inconsistent Databases, Arenas, Bertossi, Chomicki, PODS 1999 (paper)

Provenance

  • Provenance Semirings, Green, Karvounarakis, Tannen, PODS 2007 (paper)

  • Provenance in Databases: Why, How and Where, Cheney, Chiticariu, Tan, Foundations and Trends in Databases 2009 (paper)

  • On Propagation of Deletions and Annotations Through Views, Buneman, Khanna, Tan, PODS 2002 (paper)

  • Maximizing Conjunctive Views in Deletion Propagation, Kimefeld, Vondrak, Williams, TODS 2012 (paper)

Privacy

  • On the Complexity of Optimal K-Anonymity, Meyerson, Williams, PODS 2004 (paper)

  • Revealing Information while Preserving Privacy, Dinur, Nissim, PODS 2003 (paper)

  • A Firm Foundation for Private Data Analysis, Dwork, CACM 2011 (paper)