Using a Lock Coupling in LMD B?

Another approach that, for example, berkeley d b uses is to use a lock coupling. When you inserta record, it'll look at what the cursor is currently pointing at and see if it's see if it spans the space that the new record belongs to. And if it doesn't, then it'll fall back to what it has to do. It'll go back to the rout and search its way down. You know, as as you get to much larger data basis, you might see that you're over all right. Through put could be slower than optimal. It really tends to depend on the right patterns.