Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Performance of B-tree concurrency control algorithms
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
ARIES/IM: an efficient and high concurrency index management method using write-ahead logging
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
A symmetric concurrent B-tree algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Autonomous Disks for Advanced Database Applications
DANTE '99 Proceedings of the 1999 International Symposium on Database Applications in Non-Traditional Environments
Fat-Btree: An Update-Conscious Parallel Directory Structure
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Automatic Reconfiguration of an Autonomous Disk Cluster
PRDC '01 Proceedings of the 2001 Pacific Rim International Symposium on Dependable Computing
Concurrency control in B+-trees databases using preparatory operations
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
| Hi-index | 0.00 |
In this paper, we propose a new concurrency control protocol for parallel B-tree structures capable reducing the cost of structure-modification-operation (SMO) compared to the conventional protocols such as ARIES/IM and INC-OPT. We call this protocol the MARK-OPT protocol, since it marks the lowest SMO occurrence point during optimistic latch-coupling operations. The marking reduces middle phases for spreading an X latch and removes needless X latches. In addition, we propose three variations of the MARK-OPT, which focus on tree structure changes from other transactions. Moreover, the proposed protocols are deadlock-free and satisfy the physical consistency requirement for B-trees. These indicate that the proposed protocols are suitable as concurrency control protocols for B-tree structures. To compare the performance of the proposed protocols, the INC-OPT, and the ARIES/IM, we implement these protocols on an autonomous disk system adopting the Fat-Btree structure, a form of parallel B-tree structure. Experimental results in various environments indicate that the proposed protocols always improve system throughput, and 2P-REP-MARK-OPT is the most useful protocol in high update environment. Additionally, to mitigate access skew, data should be migrated between PEs. We also demonstrate that MARK-OPT improves the system throughput under the data migration and reduces the time for data migration to balance load distribution.