Despite extensive research on R-trees, most of the proposed schemes have not been integrated into existing DBMS owing to the lack of protocols of concurrency control. R-link tree is an acceptable data structure to deal with this issue, but problems like phantom still exist. In this paper, we focus on a conflict detection scheme based on R-link tree for complete concurrency control. An in-memory operation control list is designed to suspend conflicting operations. The main features of this approach are (1) it can be implemented easily and does not need any extra information; (2) No deadlocks are involved in locking scheme; (3) Non-conflicting operations are not restricted; and (4) Phantom problems in R-link tree are avoided through beforehand predication. The experiment results show that this scheme is correct and gains better system performance.