/DB_Lecture_Summary

Lecture summary after taking CMU DB Lecture(by Youtube)

MIT LicenseMIT

DB_Lecture_Summary

Lecture summary after taking CMU DB Lecture(by Youtube)


I decided to go to lab and study more when I graduate university.
In other words, I'll go to gratudate school. So, I think I should study to prepare it.

Now I'm taking CMU DB Lecture by Andy Pavlo, and I want to save records of my study.
This repository is for that purpose.


Intro to Database Systems

This is a link to online lecture that I took
[Lecture LINK]

  • 8/11
    • 01. Course Introduction & Relational Model - Summary
    • 02. Advanced SQL - Summary
  • 8/12
  • 8/13
    • 05. Buffer Pools & Memory Management - Summary
  • 8/14
  • 8/15
  • 8/17
    • 09. Multi-Threaded Index Concurrency Control - Summary
    • 10. Sorting & Aggregations - Summary
    • 11. Join Algorithms - Summary
  • 8/18
    • 12. Query Execution 1 - Summary
    • 13. Query Execution 2 - Summary
    • 14. Query Planning & Optimization 1 - Summary
  • 8/19
    • 15. Query Planning & Optimization 2 - Summary
    • 16. Concurrency Control Theory - Summary
  • 8/20
    • 17. Two-Phase Locking Concurrency Control - Summary
    • 18. Timestamp Ordering Concurrency Control - Summary
    • 19. Multi-Version Concurrency Control - Summary
  • 8/21
    • 20. Database Logging Schemes - Summary
  • 8/22
    • 21. ARIES Database Recovery - Summary
    • 22. Introduction to Distributed Databases - Summary
    • 23. Distributed OLTP Databases - Summary
  • 8/24
    • 24. Distributed OLAP Databases - Summary
    • 25. Oracle In-Memory Databases - Summary

Advanced Database Systems

This is a link to online lecture that I took
[Lecture LINK]
Before taking a lecture, I read a paper that is anounced in Andy's course schedule

  • 8/26

    • 01. History of Databases
    • No paper used in this lecture
  • 8/27

    • 02. In-Memory Databases - Summary
    • X. Yu, et al., Staring into the Abyss: An Evaluation of Concurrency Control with One Thousand Cores, in VLDB, 2014
      [Paper] [Synopsis]
  • 8/28 & 8/29

    • 03. Multi-Version Concurrency Control [Design Decisions] - Summary
    • Y. Wu, et al., An Empirical Evaluation of In-Memory Multi-Version Concurrency Control, in VLDB, 2017
      [Paper] [Synopsis]
  • 8/31 & 9/1

    • 04. Multi-Version Concurrency Control [Protocols] - Summary
    • T. Neumann, et al., Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems, in SIGMOD, 2015
      [Paper] [Synopsis]
  • 9/2 & 9/4

    • 05. Multi-Version Concurrency Control [Garbage Collection] - Summary
    • J. Böttcher, et al., Scalable Garbage Collection for In-Memory MVCC Systems, in VLDB, 2019
      [Paper] [Synopsis]
  • 9/5 & 9/7

    • 06. OLTP Indexes [Part 1] - Summary
    • Z. Wang, et al., Building A Bw-Tree Takes More Than Just Buzz Words, in SIGMOD, 2018
      [Paper] [Synopsis]
  • 9/11 & 9/13 & 9/14

    • 07. OLTP Indexes [Part 2] - Summary
    • V. Alvarez, et al., A Comparison of Adaptive Radix Trees and Hash Tables, in ICDE, 2015
      [Paper] [Synopsis]
  • 9/15 & 9/16 & 9/17

    • 08. Storage Models, Data Layout, & System Catalogs - Summary
    • M. Athanassoulis, et al., Optimal Column Layout for Hybrid Workloads, in VLDB, 2019
      [Paper] [Synopsis]
  • 9/18 & 9/19 & 9/20

    • 09. Database Compression - Summary
    • D. Abadi, et al., Integrating Compression and Execution in Column-Oriented Database Systems, in SIGMOD, 2006
      [Paper] [Synopsis]
  • 9/22 & 9/23 & 9/24

    • 10. Recovery Protocol - Summary
    • P. Antonopoulos, et al., Constant Time Recovery in Azure SQL Database, in VLDB, 2019
      [Paper] [Synopsis]
  • 9/29 & 9/30 & 10/2 & 10/3

    • 11. Network Protocol - Summary
    • M. Raasveldt, et al., Don't Hold My Data Hostage: A Case for Client Protocol Redesign, in VLDB, 2017
      [Paper] [Synopsis]
  • 11/5 & 11/6

    • 12. Scheduling - Summary
    • V. Leis, et al., Morsel-Driven Parallelism: A NUMA-Aware Query Evaluation Framework for the Many-Core Age, in SIGMOD, 2014
      [Paper] [Synopsis]
  • 11/10 & 11/11 & 11/14

    • 13. Query Execution & Processing - Summary
    • M. Kester, et al., Access Path Selection in Main-Memory Optimized Data Systems: Should I Scan or Should I Probe?, in SIGMOD, 2017
      [Paper] [Synopsis]
  • 11/15

    • 14. Query Compilation - Summary
    • T. Neumann, Efficiently Compiling Efficient Query Plans for Modern Hardware, in VLDB, 2011
      [Paper] [Synopsis]
  • 11/22

    • 15. Vectorized Execution - Summary
    • O. Polychroniou, et al., Rethinking SIMD Vectorization for In-Memory Databases, in SIGMOD, 2015
      [Paper] [Synopsis]
  • 11/29

    • 16. Vectorize VS. Compilation - Summary
    • T. Kersten, et al., Everything You Always Wanted to Know About Compiled and Vectorized Queries But Were Afraid to Ask, in VLDB, 2018
      [Paper] [Synopsis]
  • 1/4

    • 17. Hash Join Algorithms - Summary
    • S. Schuh, et al., An Experimental Comparison of Thirteen Relational Equi-Joins in Main Memory, in SIGMOD, 2016
      [Paper] [Synopsis]
  • 1/8 & 1/9

    • 18. Parallel Sort-Merge / Sorting Algorithms - Summary
    • C. Balkesen, et al., Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited, in VLDB, 2013
      [Paper] [Synopsis]
  • 1/15 & 1/18

    • 19. Query Optimizer Implementation - Summary
    • S. Chaudhuri, An Overview of Query Optimization in Relational Systems, in PODS, 1998
      [Paper]
  • 1/23 & 1/25

    • 20. Query Optimizer Implementation - Summary
    • Yongwen Xu, Efficiency in the Columbia Database Query Optimizer (pages 1-35), in Portland State University, 1998
      [Paper]
  • 2/1 & 2/3

    • 21. Query Optimizer Implementation - Summary
    • B. Ding, et al., Plan Stitch: Harnessing the Best of Many Plans, in VLDB, 2018
      [Paper] [Synopsis]
  • 2/8 & 2/9

    • 22. Cost Model - Summary
    • V. Leis, et al., How Good are Query Optimizers, Really?, in VLDB, 2015
      [Paper]
  • 2/18

    • 23. Larger than Memory Database - Summary
    • V. Leis, et al., LeanStore: In-Memory Data Management beyond Main Memory, in ICDE, 2018
      [Paper]