摘要
针对分布式数据库的并发控制提出了一种新算法 .本算法根据新事务与本地节点上已启动但还未完成事务的信息进行比较 ,动态地在一种称为 EWP的乐观并发控制算法与一种称为 PSL的悲观并发控制算法之中选择一种算法来实现对该新事务的并发控制 .本算法是在文中提出的 EWL算法的基础上修改而成的 ,它比原来的
This paper presents a new algorithm which is useful to concurrency control of distributed database system.The new algorithm is realized by selecting dynamically between optimistic algorithm which is named EWP and pessimistic algorithm which is named PSL,according to the result of comparing a new management with unfinished managements in local site. The new algorithm is finished by amending the EWL algorithm presented in thispaper,and it has more self adaptability than the EWL.
出处
《小型微型计算机系统》
CSCD
北大核心
2003年第8期1507-1509,共3页
Journal of Chinese Computer Systems
关键词
分布式数据库系统
并发控制
乐观并发控制算法
悲观并发控制算法
distributed database system
concurrency control
optimistic argorithm of concurrency control
pessimistic argorithm of concurrency control
