Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concepts of transactions, concurrency control, and the Kung-Robinson Model in the context of optimistic concurrency control. It explains the key idea of timestamp ordering, the three phases of transactions, validation tests, and the overheads involved in optimistic concurrency control. The lecture also discusses the continuous validation approach, timestamp-based concurrency control, and the rules for reading and writing objects based on timestamps. Additionally, it addresses the challenges of recoverability in timestamp-based concurrency control.