In this course we will discuss some advanced database concepts and techniques, including:
1. SQL, Relational Algebra/Calculus, Index, Views, Constraints
2. Data Models, including NoSQL, I/O Model, Streaming Model, MapReduce, ActiveDHT
3. Query Optimization, including Optimal Join Algorithm
4. Transactions
5. Data Privacy, including Differential Privacy
Detailed list of topics is available in the course schedule below.
Participants are expected to have a background in algorithms and data structures, and some basic knowledge in databases.
The evaluation will be based on a set of exercises and exams, and a course project.
Qin Zhang
Office hour: Tuesday 3:00pm4:00pm (LH430A)
or by email appointment (I usually do not accept same day appointment requests, so please contact me one or two days ahead)
Email: qzhangcs@indiana.edu
Week  Date  Section  Content  Slides  Comments 

1  Aug. 25  0. Introduction  slides  
1  Aug. 27  0. Backgroud Survey  
2  Sep. 1  1. Basics  SQL  oncourse  CB Ch. 6 (book chapters that are relevant. Note: we do not strictly follow) 
2  Sep. 3  SQL (cont.)  oncourse  CB Ch. 6  
3  Sep. 8  Relational Algebra/Calculus, Datalog 
oncourse  CB Ch. 5  
3  Sep. 10  Relational Algebra/Calculus, Datalog (cont.) 
oncourse  CB Ch. 5  
4  Sep. 15  Relational Calculus (cont.) View, Index, Constraints 
oncourse  CB Ch. 7, 8, 14  
4  Sep. 17  View, Index, Constraints (cont.)  oncourse  CB Ch. 7, 8, 14  
5  Sep. 22  View, Index, Constraints (cont.)  oncourse  CB Ch. 7, 8, 14  
5  Sep. 24  2. Data Models  Old Models, NoSQL ER&XML 
slides oncourse 
XML in CB Ch. 11 
6  Sep. 29  NoSQL  slides  
6  Oct. 1  I/O Model  slides  CB Ch. 13  
7  Oct. 6  Streaming Model  slides  CB Ch 23.4, 23.5  
7  Oct. 8  Streaming Model (cont.)  slides  Sections 1, 2, 4 of Chakrabarti's notes  
8  Oct. 13  MapReduce, ActiveDHT  slides  Chapter 2, 5 of this book  
8  Oct. 15  Midterm Review  Solutions for HW 1, 2, 3, 4a by Yuan Xie 
Midterm preparation: SQL, RC, Datalog View, Constraint, Indexing (Old) data models, NoSQL, I/Omodel, streaming model 

9  Oct. 20  Midterm  
9  Oct. 22  3. Optimization  Query Processing  oncourse  CB Ch. 15 
10  Oct. 27  Query Processing (cont.)  oncourse  CB Ch. 15  
10  Oct. 29  Query Optimization  oncourse  CB Ch. 16  
11  Nov. 3  Query Optimization (cont.)  oncourse  CB Ch. 16  
11  Nov. 5  Optimal Join Algorithm  Ré's slides  
12  Nov. 10  4. Trasactions  Recovery  oncourse  CB Ch. 17 
12  Nov. 12  Concurrency Control  oncourse  CB Ch. 18  
13  Nov. 17  Concurrency Control (cont.)  oncourse  CB Ch. 18  
13  Nov. 19  Concurrency Control (cont.)  oncourse  CB Ch. 18  
14  Nov. 24  Thanksgiving Break  
14  Nov. 26  Thanksgiving Break  
15  Dec. 1  5. Data Privacy  Introduction  oncourse  
15  Dec. 3  Differential Privacy  oncourse  
16  Dec. 8  Final Review  Solutions for HW 4b, 5 & 6 by Yuan 
Final preparation: topics in midterm MapReduce algorithm, RA, laws of RA, logical/physical query plan, cost estimation join ordering selection, UNDO/REDO logging, (conflict, view) serializability, Recoverability (strict) 2PL, lock modes (S, X, U) 

16  Dec. 10  Final 
For assignments, students may discuss answers with anyone, including problem approaches and proofs. But all students must write their own proofs, and writeups. The names of all people that you have talked to should be listed at the beginning of the first page. If a solution comes from existing papers/web/books, they must be properly cited, and you must write the solution in a way that demonstrates your understanding (simply copying the solution will be considered as plagiarism). All deadlines are firm. No late assignments will be accepted unless there are legitimate circumstances.
For more details, see Indiana University Code of Student Rights, Responsibilities, and Conduct.