ConceptSystems & CS
Wait-for graph
A structure where nodes are transactions and an edge from T1 to T2 means T1 is waiting for T2 to release a lock.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
2Each in their own terms, from the easiest level.
Andy Pavlo
A graph used to detect deadlocks by tracking which transactions are waiting for locks held by other transactions.
Connections
5The lectures that define it or assume it, and the concepts next to it.