B-link Optimization
B-link tree - Each node has a side pointer to the next
After searching a node, you can release its lock before locking its child
- r1[P] r2[P] r2[C] w2[C] w2[C´] w2[P] r1[C] r1[C´]
- Searching has the same behavior as if it locked the child before releasing the parent … and ran later (after the insert)