基于全局目录的分布式数据库加锁管理算法

针对简单的分布式封锁方法和完全分布式加锁算法在加锁时所需通信开销大、封锁时间长、锁管理复杂的缺点,结合集中式数据库加锁管理算法的优点,指出了在分布式数据库中保持事务可串行化方面存在的难点,利用全局目录和事务调度器,提出了基于全局目录的分布式数据库加锁管理算法。该算法使用两阶段封锁协议和多粒度封锁协议,在全局目录服务器中使用全局锁管理器管理和维护全局目录中的锁结点信息并对分布式封锁请求进行集中控制和灵活管理,能有效地保证事务的可串行化调度,降低封锁时的通信开销。     

一种基于加锁粒度的分布式高优先级两段锁的并发控制模型

本文通过分析并发控制中的几种锁模型及其在分布式环境下的拓展，提出了一种基于加锁粒度的分布式高优先级两段锁模型。在该模型中，引入一种加锁检测机制，通过该机制可以确定哪些冲突事务可以通过降低加锁粒度来解决冲突。同时提出了该模型的算法。该算法在避免死锁、提高事务的并发度上有很大的改善。     

基于MDRTDB并发控制协议DHP-2PL的研究

并发控制协议是确保数据库性能目标的一个关键问题,对移动分布式实时数据库(Mobile Distributed Real-time DataBase,简称MDRTDB)并发控制协议-分布式高优先级两段锁协议(Distributed High Priority two Phrase Locking protocol,简称DHP-2PL)从两个方面做出了改进:一是采用动态优先级分配策略,能够缩短实时事务执行的等待时间和避免饥饿现象的产生;二是为了增加并发度在加锁机制中使用混合加锁粒度,同时能够减少加锁开销。最后通过模拟应用环境的性能测试表明,这两方面的改进更好地满足了事务截止期的要求,提高了移动实时事务的成功率。     

基于封锁的事务并发控制概述

叙述了关系型数据库管理系统中的事务管理和基于锁的事务并发控制方法。详细介绍了事务的串行化调度方法中的锁技术和锁协议,并深入讨论了锁的管理、死锁处理、幻影问题和其它加锁过程中可能出现的一些问题。     

基于Web的分布式数据库实时访问策略研究

基于Web的分布式数据库管理与控制是目前数据库研究的一个热点领域.针对用户要求及事务实时性的特点,分析了传统实时网络数据库访问的文件加锁、缓冲区设置、数据管理与更新方法,提出了结合虚拟锁机制的二阶段加锁方法的一种新机制,有效地解决了用户的实时访问与并发控制问题.     

基于局部路径加锁的XML并发控制协议

传统XML数据库并发控制协议大多采用基于XML文档树的路径加锁方式,并发度不高。针对该问题,提出一种基于局部路径加锁模型的XML数据库并发控制协议。该协议基于XML的节点编码,利用查询函数对目标节点的祖先后裔加锁情况进行快速判断,并根据操作类型对目标节点或者其父节点进行加锁,从而减少对锁的频繁请求,提高事务并发度以及实现大规模XML数据的有效管理。     

基于Web的分布式数据库实时访问策略研究

基于Web的分布式数据库管理与控制是目前数据库研究的一个热点领域。针对用户要求及事务实时性的特点，分析了传统实时网络数据库访问的文件加锁、缓冲区设置、数据管理与更新方法，提出了结合虚拟锁机制的二阶段加锁方法的一种新机制，有效地解决了用户的实时访问与并发控制问题。     

一种基于属性谓词锁的数据库并发控制方法

当前,在OLTP数据库的应用场景中,事务通常由一些简单的查询构成,尤其是大量存在的基于主键的读写事务.在这种应用场景下,逻辑锁能够避免复杂的逻辑判定,通过基于简单比较的语义封锁来防止不可重复读、幻象读等问题,从而实现事务的串行化调度.为了提高事务读写的并发能力,针对当前OLTP应用的特点,在谓词锁的基础上进一步细分锁粒度,提出属性谓词锁的理论,并在给定的复杂度内讨论了该理论在上述应用场景下的可行性.此外,通过在国产神通数据库的事务线程框架下模拟TPC-C的事务并发,一个测试属性谓词锁与物理行锁性能差异的实验得以顺利进行.对比实验结果表明,属性谓词锁在相对固定的属性列上进行简单查询和更新的应用中,可以大幅度地减少加锁的数目,从而在CPU和内存开销等性能指标上占据优势.     

基于相对位置的分布式实时协同编辑乐观锁并发控制算法

实时分布式协同编辑系统是计算机支持的协同工作的典型应用系统,不少学者对其进行了大量的研究,其难点是协作编辑的一致性、实时性和无约束性。因此,并发控制始终是它的研究热点,目前已提出的协同编辑的并发控制算法有:传统的加锁法、tickle锁、floor控制、可逆执行(Undo/Redo)和操作转换等。传统的加锁法最突出的优点是设计和实现较为简单,能保证具体上下文的语义完整性,但是在分布式协同编辑中无法保证加锁位置的一致性。tickle锁方法适用于分节加锁的实时分布式协同编辑的并发控制,然而无法提供多个编辑者对节内的同时编辑。JCE中的协同编辑采用了floor控制方法,每个协作编者只有获得floor才能进行     

XML数据库并发加锁协议的研究

针对XML数据动态树型结构的特点,定义了内容操作集和结构操作集.在此基础上,提出一种基于此操作集的动态加锁协议以及锁模型,并证明了此加锁协议下的调度是可串行化调度,从而实现了XML原生数据库的事务并发控制.     

协同图形图像编辑系统中对象锁与区域锁的并行

在分布式协同编辑系统中,为了防止并行操作中出现冲突,常常用到加锁的机制.分布式协同图形图像编辑系统是协同系统中一个特殊的类,因此有特殊的加锁方式.本文提出一种新的不但能够给对象加锁,而且能够给区域加锁的锁机制.在这种锁机制下,用户可以自由地选择给一个图案对象加锁或者给一个工作区域加锁.这是一种细粒度和粗粒度的结合,既有利于减少加锁时系统的负载,又有利于方便用户的操作.这个机制已经应用在我们的CoDesign系统.     

Formal Aspects of Serializability in Database Concurrency Control

An arbitrary interleaved execution of transactions in a database system can lead to an inconsistent database state. A number of synchronization mechanisms have been proposed to prevent such spurious behavior. To gain insight into these mechanisms, we analyze them in a simple centralized system that permits one read operation and one write operation per transaction. We show why locking mechanisms lead to correct operation, we show that two proposed mechanisms for distributed environments are special cases of locking, and we present a new version of lockdng that alows more concurrency than past methods. We also examine conflict graph analysis, the method used in the SDD-1 distributed database system, we prove its correctness, and we show that it can be used to substantially improve the performance of almost any synchronization mechanisn.     

Optional and responsive fine-grain locking in Internet-based collaborative systems

Locking is a standard technique used in distributed computing and database systems to ensure data integrity by prohibiting concurrent conflicting updates on shared data objects. Internet-based collaborative systems are a special class of distributed applications which support human-to-human interaction and collaboration over the Internet. In this paper, a novel optional and responsive fine-grain locking scheme is proposed for consistency maintenance in Internet-based collaborative editors. In the proposed scheme, locking is made optional in the sense that a user may update any part of the document without necessarily requesting a lock. In the face of high communication latency in the Internet environment, responsive locking is achieved by granting the permit to the user for updating the data region immediately after issuing a locking request. Moreover, multiple fine-grain locks can be placed on different regions inside a document to allow concurrent and mutually exclusive editing on the same document. Protocols and algorithms for locking conflict resolution and consistency maintenance are devised to address special technical issues involved in optional and responsive fine-grain locking. The proposed locking scheme and supporting techniques were implemented in an Internet-based collaborative editor to demonstrate its feasibility and usability.     

The effects of two-phase locking on the performance of a distributed database management system

In this paper, the effects of two-phase locking on the performance of a distributed database management system are evaluated. In particular, the relationship between the average transaction response time for four concurrency control algorithms based on two-phase locking has been established with respect to the static degree of interference for a given multiprogramming level, database size, and transaction size. The increase in average probability of one lock request conflicting with another has been measured with respect to the static degree of interference and the percentage of aborted transactions has been measured for each algorithm. In addition, the impact of a number of parameters (e.g. data replication, lock predeclaration, time-out, local processing time, degree of locality of references, interarrival time, number of nodes and transmission time) on the performance of a distributed database management system in the presence of a concurrency control mechanism has also been measured. The study has been made using simulation and the SIMULA programming language.     

Distributed concurrency control based on limited wait-depth

The performance of high-volume transaction processing systems for business applications is determined by the degree of contention for hardware resources as well as for data. Hardware resource requirements may be met cost-effectively with a data-partitioned or shared-nothing architecture. However, the two-phase locking (2PL) concurrency control method may restrict the performance of a shared-nothing system more severely than that of a centralized system due to increased lock holding times. Deadlock detection and resolution are an added complicating factor in shared-nothing systems. The authors describe distributed Wait-Depth Limited (WDL) concurrency control (CC), a locking-based distributed CC method that limits the wait-depth of blocked transactions to one, thus preventing the occurrence of deadlocks. Several implementations of distributed WDL which vary in the number of messages and the amount of information available for decision making are discussed. The performance of a generic implementation of distributed WDL is compared with distributed 2PL (with general-waiting policy) and the Wound-Wait CC method through a detailed simulation. It is shown that distributed WDL behaves similarly to 2PL for low lock contention levels, but for substantial lock contention levels (caused by higher degrees of transaction concurrency), distributed WDL outperforms the other methods to a significant degree     

二维协同工作空间的并发操作加锁协议

提出一种用于在二维工作空间中协同作业的并发操作加锁协议和相应的锁调度算法,协议采用悲观锁,以抽象的二维空间为并发操作的对象,支持任意锁粒度,具有无死锁性质．加锁协议和算法存一个实时分布式协同绘图系统中实现．协议的实现采用多Agent系统模型。将面向Agent的程序设计中Agent的情绪值的概念用于控制锁的释放和调度,支持并发操作者之间的主动协同和细粒度感知．     

工程数据库锁管理系统的设计及实现

探讨了一种工程数据库管理系统中的锁管理子系统的设计和实现方法。该方法支持多粒度锁、自动加锁特性和自动锁粒度升级特性。在此基础上可以实现二阶段锁协议和树协议。     

A Parallel and Nonblocking Updating Mechanism for Replicated Directory Files in Distributed Systems

This paper presents a new and efficient method for consistency control of replicated directory files. By investigating the special consistency requirements and the data structure of directory files, we design a parallel and nonblocking updating mechanism for the management of directory files. Compared with other consistency control mechanisms, our approach has the following advantages: (1) neither global locking nor globally synchronized clocks are used; (2) updates can be issued at any node without synchronizing with each other; (3) updates from remote nodes are executed as they arrive, without being blocked. The access consistency and correctness of the mechanism are also discussed.