Home | Course Archive | Papers Archive | CV | My Keeper Shelf | Cultural References in Class | Quotes |
Date | Topic | Reading | ||||
---|---|---|---|---|---|---|
18 December | Final exam: Topics | |||||
11 December | ARIES | |||||
6 December | Optional exam and make-up quiz (extendible hashing) | |||||
4 December | Partitioning | |||||
27 November | Extendible hashing | ~haynes/Papers/ExtendibleHashing/extendibleHashing.html | ||||
20 November | Data partitioning | https://docs.microsoft.com/en-us/azure/architecture/best-practices/data-partitioning https://www.brianstorti.com/replication/ CAP Twelve Years Later | ||||
15 November | In class quiz: q1115.txt ARIES recovery | RU: 9.8 Aries example: https://courses.cs.washington.edu/courses/cse444/17wi/lectures/aries-example.pdf | ||||
13 November | Recovery | Ricardo & Urban: 9.8 Recovery: DataStructures and Algorithms.txt DB Recovery Examples | ||||
8 November | Midterm! Topics For Midterm | |||||
6 November | Basic Timestamping Protocol (avoids deadlock) Basic TimeStamping Protocol | R & U: 9.5.1 | ||||
30 October | Locking 2PL, granularity |
RU: 9.4 | ||||
25 October | Transaction Management | RU: 9.1 - 9.3 | ||||
23 October | Normalization | DefinitionsRegardingNormalForms.pdf Decomposition good and bad | ||||
18 October | Normalization | RU: 6.1 - 6.5 | ||||
16 October | Review of B tree structure Indexes: calculate # sectors, access time (for 1D array sorted, unsorted, B tree) | |||||
11 October | Indexes: primary, clustering, secondary; dense and sparse Heuristics for choosing indexes |
https://www.tutorialspoint.com/dbms/dbms_indexing.htm https://www.tutorialspoint.com/dbms/dbms_indexing.htm https://en.wikipedia.org/wiki/Database_index | ||||
9 October 2018 | Data structures for DBMS | B-tree B-tree and B+ tree (Univ Washington) B+ tree (Univ Washington) Hashing Wikipedia on Bloom filter, medium.com on Bloom filter | ||||
4 October | DML | RU: 5.4, 5.5 | ||||
27 Sept | quiz today on relation algebra/expression tree/SQL | |||||
25 September | DDL, more joins | RU: 5.3 5.4 Definitions of Joins | ||||
20 Sept | EER diagrams more relational algebra and expression trees |
Chpt 3, 4 | ||||
18 September | ER diagram -> tables relational algebra |
RU: Chpt 3,Chpt 4 | ||||
13 September | ER diagram: Entity, Relationships | RU: Chapter 3: 3.1 - 3.5 | ||||
11 Sept |
| |||||
6 Sept |
| http://w3schools.com/sql |
Assigned | Due | Link or description | Turn in? (YES or NO) | Comment |
---|---|---|---|---|
27 November | hw1127: practice extendible hashing | NO | ||
15 November | 4 December | hw1115: Comparing data structures for joins -- INTERNAL | YES | O(n^2) vs O(n) (actually, O(n^2) vs O(nm) where is m is size of overflow table)
int x = 13; |
15 November | 13 December | hw1115: Comparing data structures for joins -- EXTERNAL | YES | O(n^2) vs O(n) Note: after last day of class |
10/18 | 10/25 | hw1018 | YES | Normalize to 3NF |
10/11 | 10/23 | HW1011 | YES | Designing indexes |
9/27 | | Assgn0927 | YES | |
9/18 | 9/25 | hw0918: Exercise 3.4 ("Design a database ..."), 3.6 ("An interior design firm ..."). | YES | Hand-drawn or machine drawn |
9/13 | 9/18 | hw0913b | NO (there will be cumulative quiz on 9/18) | w3schools.com/sql |
9/13 | 9/18 | hw0913a: Exercise 3.2 ("A private book collector ....") | YES | Hand-drawn or machine-drawn |
9/11 | 9/13 | hw0911.pdf | NO | w3schools.com/sql: SELECT |
9/6 | 9/11 | hw0906.pdf | NO | w3schools.com/sql: SELECT |
9/6 | 9/13 | Assgn0906 | yes | 1. size of char array? --> any size 200 or greater. In class I suggested size 1000. 2. Important point on char array: Allocate it up front! Do NOT allocate space as needed, and do NOT use ArrayList |