Optimize the crabbing algorithm in b+ tree concurrency control

[zevin02]

Search before asking

I had searched in the issues and found no similar issues.

Motivation

We would like to optimize the crabbing algorithm in b+ tree concurrency control

Solution

When inserting data, add a read lock to the internal node, and add a write lock to the last leaf node at last.
But if you need to split, you need to add write locks all the way from the root node to perform split and merge operations.
the same as Remove

Are you willing to submit a PR?

I'm willing to submit a PR!