Home | Course Archive | Papers Archive | CV | My Keeper Shelf | Cultural References in Class | Quotes |
Date | Topic | Reading |
---|---|---|
4/18 | Semistructured data (OEM graph), XML, Mapping between OEM, XML and relational data model | C & B: 30.1, 30.2 |
4/16 | Distributed Database: duplicated data,
fragmentation (vertical, horizontal) Discretionary Access Control (DAC) |
C & B 22.4.1, 22.4.2 C & B: 7.6, 20.2, DACinSQL.txt |
Trans mgmt: Recovery - log, Checkpoint, REDO/UNDO, steal/no-steal, force/no-force | C & B: 22.3.3 | |
4/2 | Trans mgmt: Granularity of locking (intension locks), Beginning recovery -- paging, page replacement, dirty bit, page in use | C & B:22.2.8, 22.3.1 Multiple Granularity Locking (intension locks) |
Trans mgmt: shared, exclusive lock, 2PL, Deadlock (prevention, detection) Wait-For graph, Timeout, Timestamping | C & B: 22.2.3, 22.2.4,22.2.5 | |
Transaction Management: Defn of schedule, conflicting operation, Conflict serializability (testing for it), Locking | C & B 22.2.1, 22.2.2, 22.2.3 | |
3/19 | https://www.cs.purdue.edu/homes/bb/cs448_Fall2017/lpdf/Chapter15.pdf Transaction Management |
See Practice below in Homework section C & B: 22.1, 22.2-1, 22.2.2, 22.2.3 |
3/12 | Normalization 1NF -> 2NF -> 3NF -> BCNF 4NF | C & B: chpt 14 |
3/7 | Normalization Anomalies: Insertion, Update, Delete |
C & B: 14:1-9 Simple normalization example |
3/5 | MIDTERM | |
2/21 | More ER Modellinghttp://comet.lehman.cuny.edu/jung/cmp420758/chapter7.pdf | |
2/19 | Entity Relationship Modelling | C & B: Chpt 12 Sections 1- 6 |
2/7 | Extendible hashing, Intro to indexes | C & B: Appendix F smh's write-up |
2/5 | Physical model ("File Organizations and Indexes") | C & B: Appendix F |
1/24 | In class exercises for relational algebra DML Relational Model: terminology (1st normal form), superkey, candidate key, primary key, foreign key, null entity integrity, referential integrity, views |
C & B: Chpt 6 C & B: 5.1 C & B: chpt 4 |
1/22 | Joins: inner (theta, equi, natural); outer (left, right, full) from the perspectives of relational algebra and SQL | C & B: 5.1, 6 |
1/17 | A simple system catalog: format and use | |
1/15 | Relational algebra, expression tree, elementary SELECT | C & B 5.1, 6 |
1/10/2019 | Simple database design (veterinary office) Review of memory hierarchy | Vet office handout in class Memory hierarchy handout in class |
1/8/2019 | Course overview | Libre office (see Assignments below) |
Assigned | Due | Link or description | Turn in? (YES or NO) | Comment | ||||
---|---|---|---|---|---|---|---|---|
3/19 | N/A | Use algorithm 1 (Algorithm 15.1): On R(A, B, C, D) with F = { A -> B D, B -> C }, FIND A+, FIND B+ On S(W, X, Y, Z) with G = {W X -> Y, Y -> Z}, FIND (WX)+ On R(A, B, C, D) with F = {B -> A, BC -> D, C -> A} find F+ On S(A, B, C, D) with F = { A -> B C D, B C -> A, B -> D } find two candidate keys | NO | |||||
3/15 | 3/19 | hw0314: comparing ER to 1NF -> 2NF -> 3NF normalization | ||||||
3/7 | 3/12 | hw0307: Chen --> UML | YES | |||||
2/7 | 2/7 | hw0207: random access file and hashing exercise | YES |
| ||||
1/22 | 1/29 | hw0122: System Catalog practice | YES | |||||
1/10 | 1/17 | hw0110: Mr Hooch's inventory | YES | |||||
1/8 | quickly | Download LibreOffice www.libreoffice.org LibreOffice Base youtube tutorials: Start here Create database, create table, populate table, simple form, queries (design view vs SQL view), relationships, joins: 1, 2, 6, 17-25, 30, 40-41 | NO | By preference, use C & B DreamHouse |
Date | Topic |
---|---|
4/16 | q0416 - A C I D, use of transaction log, UNDO/REDO-- WITH SOLUTIONS |
4/4 | q0404 - timestamp protocol for deadlock avoidance -- WITH SOLUTIONS |
3/27 | q0327 -- Conflict serializability and 2PL -- WITH SOLUTIONS |
3/19 | q0319 - Normalization |
2/7 | q0207 - relational algebra and expression tree |
1/22 | relational algebra |