Simplified Predicate Locking Scheme for Concurrency Control on R-tree

초록

Despite extensive research on R-trees, most of the proposed schemes have not veen integrated into existing DBMS due to the lack of protocol to provide consistency in concurrent environment. R-link tree is an acceptable data structure to deal with this issue, but still not enough. In this paper, we focus on a simplified predicate locking mechanism based on R-link tree for concurrency control and phantom protection. An in-memory operation control list used to suspend some conflicting operations is designed here. The main features of this paaroach are (1) it can be implemented easily and do not need any extra information.(2) Only-one-lock is held when descending R-tree even when node split happens, while lock-coupling scheme is performed when ascending, No deadlock are possible. (3) Searches and insertions are not unnecessarily restricted. (4) Insert and Delete phantom in R-link tree are avoided throuhh beforehand predication.