ConceptSystems & CS
Optimistic Latching
A concurrency control technique that assumes modifications will not require structural changes like splits or merges, allowing threads to traverse the tree using read latches and only acquiring write latches when necessary.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.