
Episode 485: Howard Chu on B+tree Data Structure in Depth
Software Engineering Radio - the podcast for professional software developers
00:00
How Do You Get Into Lock Conflicts?
Lock conflicts are not an exceptional, unusual condition in berkeley d b when you have multiple writers. So every time you hit a lock conflict, one of the writers has to give up and release all its locks. There's another method, which yonow was relatively recent called a b link tree. Re leaf notes contain link pointers to their sib links. And by maintaining these link pointers, it actually allows you to do ads and delets with high concurrency without as much lock overhead.
Transcript
Play full episode