An efficient concurrency control algorithm for high-dimensional index structures

In this paper we propose an efficient concurrency control algorithm based on the link technique of R^Link-Tree for high-dimensional index structures. Unlike the R^Link-Tree concurrency control algorithm, it does not employ lock-coupling while ascending the index trees to process node splits and MBR (minimum bounding region) updates. Additionally, the algorithm provides the concurrency control mechanisms for forced reinsertion operations that are used to improve search performance in multi-dimensional index trees. We show through experiments that our proposed method outperforms the existing R^Link-Tree algorithm