| Spring 2021 (21-2 or 2214) |
| CS2550: Principles of Database Systems |
| University of Pittsburgh, Department of Computer Science |
| Home |
| Syllabus |
| Policies |
| Schedule |
| Class Notes & Videos |
| » Extra Material |
| Assignments |
| » Submit |
| FAQ |
| DB@PittCS |
Lectures Zoom Details
| Class Logistics & Introduction to Database Systems | Chapter 1 from the textbook |
1 slide per page 4 slides per page |
||
| Basic Design of a Query Language | Chapter 2.0-2.3, 6.0-6.5, 8.1-8.2.2, 8.5 & 10.1 from the textbook |
1 slide per page 4 slides per page |
||
| Basic Design of a Query Language | Chapter 2.0-2.3, 6.0-6.5, 8.1-8.2.2, 8.5 & 10.1 from the textbook |
1 slide per page 4 slides per page |
||
| Basic Design of a Query Language | Chapter 2.0-2.3, 6.0-6.5, 8.1-8.2.2, 8.5 & 10.1 from the textbook |
1 slide per page 4 slides per page |
||
| Transactions and Specifying C of ACID (Integrity Constraints) | Chapter 7 from the textbook |
1 slide per page 4 slides per page |
||
| Transactions Computational Models | from the textbook |
1 slide per page 4 slides per page |
||
| Theory of Recovery | from the textbook |
1 slide per page 4 slides per page |
||
| Theory of Recovery | from the textbook |
1 slide per page 4 slides per page |
||
| Theory of Concurrency | from the textbook |
1 slide per page 4 slides per page |
||
| Theory of Concurrency | from the textbook |
1 slide per page 4 slides per page |
||
| Theory of Concurrency (View Serializability) | from the textbook |
1 slide per page 4 slides per page |
||
| Data Storage | from the textbook |
1 slide per page 4 slides per page |
||
| Data Storage | from the textbook |
1 slide per page 4 slides per page |
||
| Bloom Filters | from the textbook |
1 slide per page 4 slides per page |
||
| Data Storage | from the textbook |
1 slide per page 4 slides per page |
||
| Data Storage | from the textbook |
1 slide per page 4 slides per page |
||
| File Organization | from the textbook |
1 slide per page 4 slides per page |
||
| File Organization | from the textbook |
1 slide per page 4 slides per page |
||
| Index Structures | from the textbook |
1 slide per page 4 slides per page |
||
| Index Structures | from the textbook |
1 slide per page 4 slides per page |
||
| Index Structures | from the textbook |
1 slide per page 4 slides per page |
||
| Midterm Exam | on Canvas | |||
| Index Structures | from the textbook |
1 slide per page 4 slides per page |
||
| Query Processing - Relational Algebra review | from the textbook | 4 slides per page | ||
| Query Processing | from the textbook |
1 slide per page 4 slides per page |
||
| Query Processing | from the textbook |
1 slide per page 4 slides per page |
||
| Query Optimization | from the textbook |
1 slide per page 4 slides per page |
||
| Query Optimization | from the textbook |
1 slide per page 4 slides per page |
||
| Recovery Techniques | from the textbook |
1 slide per page 4 slides per page |
||
| Recovery Techniques | from the textbook |
1 slide per page 4 slides per page |
||
| Recovery Techniques | from the textbook |
1 slide per page 4 slides per page |
||
| Concurrency Control - Locking Techniques | from the textbook |
1 slide per page 4 slides per page |
||
| Concurrency Control - Locking Techniques | from the textbook |
1 slide per page 4 slides per page |
||
| Timestamp-ordering Techniques | from the textbook |
1 slide per page 4 slides per page |
||
| Concurrency Control - Certifiers/Optimistic Schedulers | from the textbook |
1 slide per page 4 slides per page |
||
| Timestamp-ordering Techniques | from the textbook |
1 slide per page 4 slides per page |
||
| Distributed Databasese Systems | from the textbook |
1 slide per page 4 slides per page |
||
| Final Exam Review |
|
|||
| Final Exam | on Canvas |
| Panos K. Chrysanthis © 2021 | Last updated on April 28, 2021 at 03:31:39 EST |