在事务并发访问数据库的过程中,锁是数据完整性和一致性的重要保证.通过对SQL Server 2000数据库锁机制的研究,介绍了SQL Server 2000数据库锁的概念、粒度和保持以及锁的模式和相容性.对死锁问题进行了具体分析,并提出相应的预防策略;...在事务并发访问数据库的过程中,锁是数据完整性和一致性的重要保证.通过对SQL Server 2000数据库锁机制的研究,介绍了SQL Server 2000数据库锁的概念、粒度和保持以及锁的模式和相容性.对死锁问题进行了具体分析,并提出相应的预防策略;分析了实际应用中用户自定义锁定问题,给出一些相关的解决实例.展开更多
This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are propos...This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are proposed in the paper. The ideas of single queue scheduling(SQS) and dual queue scheduling (DQS) are proposed and the algorithm and the performance evaluation for these two scheduling are presented in some paper. This paper describes a new idea of thescheduling for MGL, compatible requests first (CRF). Combining the new idea with SQS and DQS,we propose two new scheduling algorithms called CRFS and CRFD. After describing the simulationmodel, this paper illustrates the comparisons of the performance among these four algorithms. Asshown in the experiments, DQS has better performance than SQS, CRFD is better than DQS, CRFSperforms better than SQS, and CRFS is the best one of these four scheduling algorithms.展开更多
文摘在事务并发访问数据库的过程中,锁是数据完整性和一致性的重要保证.通过对SQL Server 2000数据库锁机制的研究,介绍了SQL Server 2000数据库锁的概念、粒度和保持以及锁的模式和相容性.对死锁问题进行了具体分析,并提出相应的预防策略;分析了实际应用中用户自定义锁定问题,给出一些相关的解决实例.
文摘This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are proposed in the paper. The ideas of single queue scheduling(SQS) and dual queue scheduling (DQS) are proposed and the algorithm and the performance evaluation for these two scheduling are presented in some paper. This paper describes a new idea of thescheduling for MGL, compatible requests first (CRF). Combining the new idea with SQS and DQS,we propose two new scheduling algorithms called CRFS and CRFD. After describing the simulationmodel, this paper illustrates the comparisons of the performance among these four algorithms. Asshown in the experiments, DQS has better performance than SQS, CRFD is better than DQS, CRFSperforms better than SQS, and CRFS is the best one of these four scheduling algorithms.
