Despite extensive research on R-trees, most of the proposed schemes have notbeen integrated into existing DBMS owing to the lack of protocols of concurrency control. R-linktree is an acceptable data structure to deal ...Despite extensive research on R-trees, most of the proposed schemes have notbeen integrated into existing DBMS owing to the lack of protocols of concurrency control. R-linktree 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 completeconcurrency control. An in-memory operation control list is designed to suspend conflictingoperations . The main features of this approach are (1) it can be implemented easily and does notneed any extra information ; (2) No deadlocks are involved in locking scheme ; (3) Non-conflictingoperations are not restricted ; and (4) Phantom problems in R-link tree are avoided throughbeforehand predication . The experiment results show that this scheme is correct and gains bettersystem performance.展开更多
文摘Despite extensive research on R-trees, most of the proposed schemes have notbeen integrated into existing DBMS owing to the lack of protocols of concurrency control. R-linktree 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 completeconcurrency control. An in-memory operation control list is designed to suspend conflictingoperations . The main features of this approach are (1) it can be implemented easily and does notneed any extra information ; (2) No deadlocks are involved in locking scheme ; (3) Non-conflictingoperations are not restricted ; and (4) Phantom problems in R-link tree are avoided throughbeforehand predication . The experiment results show that this scheme is correct and gains bettersystem performance.
