基于语义可串行性的锁协议并发控制算法

为实现语义可串行性调度而提出的基于两段锁协议的并发控制算法无法保证所得到的历史具有可恢复性，为解决该算法的可用性问题，利用并发控制和恢复的统一模型给出一种基于两段锁协议的并发控制算法。     

A New Primary Lazy Update Propagation Protocol for Replicated Databases

This paper proposes a new primary lazy update protocol, PTCS （Primary Transaction Commit Schedule）. In the PTCS protocol, a serializable primary transaction schedule is generated firstly and then the secondary transactions are committed according to the serializable primary transaction schedule. PTCS protocol can guarantee serializability if the data copy graph contains no directed circles. It can also be ex tended to eliminate all requirements on the data copy graph. Compared to earlier works, PTCS protocol not only imposes a much weaker requirement on the data placement, but also avoids the deadlock caused by transaction waits and extra message overhead. The performance experiments show that the degradation of the performance caused by the replica man- agement of the PTCS protocol is tolerable.     

MDBS中2LSR调度正确性的方法研究

为了提高多数据库环境下事务处理的并发度,选择放松可串行化标准作为可行的解决途径.以二级可串行化(2LSR)作为新的串行化标准,对保证调度正确性的两种典型方法进行了比较分析,总结了基于视图的方法的优越性;针对基于视图的方法,提出了一种优化的设计实施方案.     

数据库系统并发控制的扩展有色Petri网方法

加锁与可串行化是并发控制中采取的2个主要措施.两段锁协议(two-phase locking protocol,简称2PL)是解决可串行化调度较好的方法之一,但满足可串行化的调度可能会出现死锁.为此建立了多个事务并发访问数据库的扩展有色Petri网模型,该模型可使并发事务的调度符合两段锁协议.利用该模型的可达标识图,给出了判断满足两段锁协议的调度是否死锁的充分必要条件,并由此构造出并发事务的无死锁的可串行化调度.     

基于事务和对象语义的长事务处理方法

数据库应用中出现的长事务严重降低了系统性能，一些研究者提出利用事务的语义信息对事务进行分解来解决这个问题，但是由于分解本身的需要满足一些特性，使得一些长事务无法分解。本文在事务分解的基础上提出了利用对象的语义信息来提高事务的并发度的方法，给出基于语义的正确性标准和一种基于有向图的正确性判定方法。     

一种针对长事务的两步锁的改进方法

给出了一种两步锁的扩充，称为利它锁，即让长事务较早地释放其占用的锁，使需要存取这些被锁数据的事务在长事务处于唤醒状态时，遵循一定的锁规则同时运行。     

Quasi Serializable Concurrency Control in Distributed Real—Time Database Systems

This paper formally defines and analyses the new notion of correctness called quasi serializ-ability,and then outlines corresponding concurrency control protocol QDHP for distributed realtime databases.Finally,through a series of simulation studies,it shows that using the new concurrency control protocol the performance of distributed real-time databases can be much improved.     

Weak Serializable Concurrency Control in Real-time Broadcast Environments

Given the asymmetric communication capabilities in mobile real-time environments, traditional serializability-based approaches are too restrictive, unnecessary, and impractical. Thus propose the use of a new weaker correctness criterion is proposed. This paper first formally defines the new notion of correctness called weak serializability. After the necessary and sufficient conditions for weak serializability are shown, corresponding concurrency control protocol based on this criterion is outlined for real-time broadcast environments. Finally, the simulation results confirmed that the proposed techniques help mobile transactions to meet their deadlines and improve query response time.     

多数据库事务处理中的并发控制

分析了多数据库系统中事务的特征,指出多数据库事务处理的并发控制问题需保持全局可串行化,即要求在各局部场地局部事务的执行不违反全局的执行次序．研究了ＴＳＧ,Ｔｉｃｋｅｔ和基于冲突检测的保持全局可串行化算法,并对ＴＳＧ算法给出证明．     

事务框架下主动规则的并发控制算法

探讨并行规则事务对于共享数据对象的锁继承和锁剥夺关系 ,提出一个并发控制算法 ,并基于层次可串行性标准证明算法的正确性 .