计算机科学 ›› 2015, Vol. 42 ›› Issue (Z6): 1-4.

• 智能计算 •    下一篇

基于动态决策的并发控制算法

陈乙睿,庄毅   

  1. 南京航空航天大学计算机科学与技术学院 南京210016,南京航空航天大学计算机科学与技术学院 南京210016
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金青年科学基金项目(61202351),国家博士后基金项目(一等)(2011M500124),南京航空航天大学基本科研业务费(NS2012133),江苏省普通高校研究生科研创新计划资助

Concurrency Control Algorithm Based on Dynamic Decision

CHEN Yi-rui and ZHUANG Yi   

  • Online:2018-11-14 Published:2018-11-14

摘要: 并发控制算法能够保证多个用户同时存取数据库中同一数据时不破坏事务的隔离性和统一性。针对现有并发控制算法适应性较差的问题,提出了自适应并发控制算法。该算法将并发控制过程分为两个阶段:执行授权和策略选择。执行授权阶段根据事务的有效性决定冲突事务执行的顺序;策略选择阶段根据事务的读写状态以及当前冲突率动态地选择乐观/悲观冲突消解策略。设计的策略选择机制使得无论数据库是处于空闲还是繁忙状态,DDCC算法都具有较高的执行效率。通过对比实验验证了所提出的DDCC算法的性能要优于经典的两阶段加锁并发控制算法和HCC算法。

Abstract: The concurrency control algorithm can guarantee the isolation and consistency of transactions when multiple users access the same date at database simultaneously.This paper proposed an adaptive decision concurrency control algorithm to solve the problem of poor adaptability in existing concurrency control algorithms.This algorithm divides its concurrency control process into two phases:the execution authorizing phase and the strategy selecting phase.In the exe-cution authorizing phase,the algorithm compares effectiveness of transactions to determine the execution order of conflicting transactions.After that,the algorithm selects optimistic/pessimistic conflict resolution strategy dynamically according to the transactions’ read/write status and the current conflict rate in the strategy selecting phase.DDCC algorithm has high efficiency no matter whether the system is busy or idle.Performance tests show that DDCC algorithm proposed in this paper is superior to classical strict two phases locking algorithm and hybrid concurrency control algorithm.

Key words: Concurrency control,Dynamic decision,Conflict-rate prediction,Conflict resolution

[1] Graefe G,Halim F,Idreos S,et al.Concurrency control for adaptive indexing[J].Proceedings of the VLDB Endowment,2012,5(7):656-667
[2] Nystrom D,Nolin M,Tesanovic A,et al.Pessimistic concurrency control and versioning to support database pointers in real-time databases[C]∥16th Euromicro Conference on Real-Time Systems,2004(ECRTS 2004).IEEE,2004:261-270
[3] Mao Q,Wang J,Zhan Y.The optimistic locking concurrencycontrolling algorithm based on relative position and its application in real-time collaborative editing system[C]∥The 8th International Conference on Computer Supported Cooperative Work in Design,2004.IEEE,2004,1:99-105
[4] Makni A,Bouaziz R,Gargouri F.Formal verification of an optimistic concurrency control algorithm using SPIN[C]∥Thirteenth International Symposium on Temporal Representation and Reasoning,2006(TIME 2006).IEEE,2006:160-167
[5] Aydonat U,Abdelrahman T S.Relaxed concurrency control in software transactional memory[J].IEEE Transactions on Parallel and Distributed Systems,2012,23(7):1312-1325
[6] Sheikhan M,Rohani M,Ahmadluei S.A neural-based concurrency control algorithm for database systems[J].Neural Computing and Applications,2013,22(1):161-174
[7] Sheikhan M,Ahmadluei S.An intelligent hybrid optimistic/pessimistic concurrency control algorithm for centralized database systems using modified GSA-optimized ART neural model[J].Neural Computing andApplications,2013,23(6):1815-1829
[8] 彭林,谢伦国,张小强.采用向量时钟的软件事务存储算法[J].计算机科学,2010,37(5):282-286
[9] Jea K F,Chen S Y.A high concurrency XPath-based lockingprotocol for XML databases[J].Information and Software Technology,2006,48(8):708-716
[10] Pleshachkov P O,Kuznetsov S D.Transaction management in RDBMSs with XML support[J].Programming and Computer Software,2006,32(5):243-254

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!