An Efficient Concurrency Control Algorithm for High-Dimensional Index Structures

Abstract

In this paper, we propose a concurrency control algorithm based on link-technique for high-dimensional index structures. In high dimensional index structures, search operations are generally more frequent than insert or delete operations and need to access more nodes than those in other index structures, such as B+-tree, B-tree, hashing techniques, and so on, due to the properties of queries. In the proposed algorithm, we focus on minimizing the delay of search operations in all cases. It also supports concurrency control on reinsert operations for the high-dimensional index structures employing reinsert operations to improve their performance. We apply the algorithm to one of the exiting multi-dimensional index structures and implement it on a storage system. It is shown through various experiments that the proposed algorithm is more suitable for high dimensional index structures than existing ones.