From 53cd81e584acc771dd850a78074cac0e83871d93 Mon Sep 17 00:00:00 2001 From: Oliver Kennedy Date: Sat, 10 Sep 2016 00:11:59 -0400 Subject: [PATCH] Formatting and next week's schedule --- src/teaching/cse-662/index.md | 15 ++++++++------- 1 file changed, 8 insertions(+), 7 deletions(-) diff --git a/src/teaching/cse-662/index.md b/src/teaching/cse-662/index.md index e8b7a7b0..e02d93d4 100644 --- a/src/teaching/cse-662/index.md +++ b/src/teaching/cse-662/index.md @@ -70,10 +70,14 @@ After the taking the course, students should be able to: ## Course Schedule * **Aug. 29** : Introduction ([slides](http://odin.cse.buffalo.edu/slides/cse662fa2016/2016-08-29-Intro.pdf)) -* **Aug. 31** : Project Background 1 - ([Mimir](http://odin.cse.buffalo.edu/slides/talks/2016-3-NYU-Mimir/), [JITDs](http://odin.cse.buffalo.edu/slides/talks/2015-3-JITDs.zip)) -* **Sept. 02** : Project Background 2 - ([PocketData](http://odin.cse.buffalo.edu/slides/talks/2015-7-OhioPocketData/)) -* **Sept. 07** : Database Cracking - ([paper](http://stratos.seas.harvard.edu/files/IKM_CIDR07.pdf), [slides](http://odin.cse.buffalo.edu/slides/cse662fa2016/2016-09-07-Cracking.pdf)) -* **Sept. 09** : Functional Datastructures - ([slides](http://odin.cse.buffalo.edu/slides/cse662fa2016/2016-09-09-FuncDSes.pdf)) +* **Aug. 31** : Project Background 1 ([Mimir](http://odin.cse.buffalo.edu/slides/talks/2016-3-NYU-Mimir/), [JITDs](http://odin.cse.buffalo.edu/slides/talks/2015-3-JITDs.zip)) +* **Sept. 02** : Project Background 2 ([PocketData](http://odin.cse.buffalo.edu/slides/talks/2015-7-OhioPocketData/)) +* **Sept. 07** : Database Cracking ([paper](http://stratos.seas.harvard.edu/files/IKM_CIDR07.pdf), [slides](http://odin.cse.buffalo.edu/slides/cse662fa2016/2016-09-07-Cracking.pdf)) +* **Sept. 09** : Functional Data Structures ([slides](http://odin.cse.buffalo.edu/slides/cse662fa2016/2016-09-09-FuncDSes.pdf)) +* **Sept. 12** : Just-in-Time Data Structures +* **Sept. 14** : Incomplete Databases +* **Sept. 16** : Probabilistic Databases + ----- @@ -81,9 +85,6 @@ After the taking the course, students should be able to: 1. Datstructures and Indexes * Functional Datastructures - * Indexes Review - * Tree vs Hash - * Clustered vs Unclustered * Adaptive Indexes * Cracker Indexes * Adaptive Merge Trees