AntDB interval index adopts improved Btree (B-Link-tree) algorithm, and supports concurrent reading and writing. There is no need to lock the whole tree when modifying Btree, nor to lock the complete path from root node to leaf node, which greatly improves concurrent performance of interval index access, meanwhile, the node merge and recycle function minimizes the memory occupation. If multiple locks need to be held at the same time, the locking order for node accesses is: left to right, top to bottom. A maximum of 3 node locks are held simultaneously at the same moment.
Top comments (0)