Optimistic Concurrency Control: Timestamp Ordering

In course

Commodo sit deserunt enim amet non mollit quis qui aliqua excepteur. Elit ad labore in magna. Irure qui incididunt nulla incididunt adipisicing qui tempor. Sunt pariatur ut qui ad Lorem non nisi est non Lorem nostrud. Quis aliquip nulla nostrud qui nostrud occaecat sunt nisi.

Description

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.

Instructor

Aliqua mollit do dolore officia deserunt aliquip non commodo aute aute elit veniam. Ullamco esse incididunt nulla laborum labore exercitation eiusmod dolore id voluptate irure. Ad fugiat ea voluptate non ex ut. Exercitation qui aliqua nostrud labore reprehenderit excepteur consectetur nostrud sunt voluptate aute. Magna dolor in ipsum proident irure. Dolore ullamco magna laborum amet ut elit do magna quis culpa aliqua officia velit irure. Minim velit mollit magna deserunt eiusmod adipisicing elit ullamco aute cupidatat magna esse.

Official source

https://mediaspace.epfl.ch/media/0_gyp35lw7

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Computer engineering

High-performance computing: Distributed computing

Related lectures (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.