移动多数据库事务模型及其可串行化事务管理

提出了一个移动多数据库全局事务模型及其可串行化事务管理技术。该技术通过从各自治站点中获取本地可串行化信息构造全局事务可串行化图GTSG来判定全局事务的可串行性。它支持全局事务的迁移、网络的断接(包括可能发生的灾难性断接)并保证全局事务的关键站点子事务的原子性和隔离性。     

一种多数据库事务模型

分析了多数据库系统中事务的特征，给出了多数据事务和事务经历的形式化描述，在此基础上，提出了多数据库事务正确性标准MDB-可串行化，最后给出了,基于MSG图的多数据库串行化定理。     

基于优先执行关系闭包运算的事务可串行化判定方法

现代数据库技术支持并发用户,会产生大量的并发事务。为了提高数据库系统的性能和维护系统的一致性,必须保证事务并发执行的可串行化调度。可串行化检测是数据库系统中事务管理的关键技术,一般采用执行图的判定方法。从关系运算的代数方法出发,提出基于事务执行优先关系的闭包运算和由此建立的联合逻辑公式的计算,通过逻辑判定来检验并发事务的可串行化。通过定理证明和实例验证,该方法取得了同执行图判定相同的效果,而且判定更直观,更易于操作实现,不需要建立复杂的图数据结构和在图搜索中检测环是否出现。     

基于P2P技术的数据库系统研究

P2P的数据库系统是一种分布式的数据库系统,它是P2P技术和传统数据库系统相结合的产物。研究把P2P的观念引入到数据库系统,建立一种C／S模式与P2P技术相结合的新系统,有效解决传统C／S结构带来的系统瓶颈问题,并对P2P技术的数据库系统的一些相关问题进行探讨。     

多数据库事务并发调度算法优化技术研究

研究优化调度数据库中事务问题,为保证多数据库中事务提交顺序,提高事务执行及提交的并发度,研究了事务提交图的调度算法TM2,针对算法TM2中事务管理器无法检测到全局事务与局部事务的间接冲突,提出了优化算法TMO,采用ticket算法在全局事务的每个子事务之间增加数据操作,以便在每个成员数据库的全局子事务之间创造直接冲突,并通过添加保存点恢复中止事务代替重做事务,保持了多数据库中事务的可串行化.通过仿真,对比了两种调度算法的性能.得出算法TMO解决了事务的可串行化问题,提高了事务的并发度,保证了事务的一致性.     

MDBS中一种改进的并发事务调度算法

MDBS中并发事务的调度策略必须满足可串行化准则,论文主要分析以事务提交图为中心的调度算法TM2,虽然保证了全局事务提交顺序的可串行化,但在提交时才进行冲突检测方式存在缺点,提出改进后的事务调度算法TM3不仅保证了全局事务的可串行化和防止了全局死锁的发生,还提高了全局事务执行的并发度。最后通过实验在数据库加速引擎中进行模拟,对比了两种调度算法的性能。     

多级多版本数据库管理系统全局串行化

多级调度应该保证事务历史可串行化,满足多级安全特性,不会引入隐通道,并保证高级别事务不会因为无限等待而"饿死".与其他多级数据管理系统调度机制相比,多级多版本时戳调度机制满足上述要求,但该机制存在两个问题,一是事务可能读旧版本,二是要求调度器是可信进程.提出一种多级多版本全局时戳调度机制(MLS_MVGTO),以及依据事务快照生成其全局时戳的基本步骤.给出了预知只读事务信息时的两种改进方法.MLS_MVGTO机制生成的事务历史可串行化,不引入隐通道等,并且该方法避免引入一个全局可信的调度器,并通过对只读事务的深入分析,允许事务读新版本.     

网格数据库事务管理策略

网格技术的本质就是提高资源的共享能力和实现计算资源的协同处理能力.网格数据库就是使传统数据库能够充分利用网格平台的这种优势,实现传统数据库的存储、管理、处理、分析等能力的共享和协同.网格数据库中的事务也存在全局事务和局部事务之分,对全局事务要保证得到正确的执行结果,其串行化是关键.给出了网格数据库全局事务的形式化定义,以及全局事务实现串行化的条件,并进行了相关证明.     

一种嵌入式移动实时数据库的并发控制策略

嵌入式移动实时事务的并发控制除了满足传统事务的基本特性外,还要着重考虑优先级颠倒、不必要的事务重启和全局数据一致性及混合事务系统的性能等问题.基于绝对串行化时序与选择重启的乐观并发控制算法(OCC-ASTOSR),利用绝对时标在广播循环的支持下调整移动客户端和中心数据库服务器上的事务串行化顺序,检测事务的数据访问冲突,并应用选择重启的方法解决冲突.事务随着运行过程更新读写数据集信息,每个数据对象都维护相关的时间信息,通过无线网络通信传递这些控制信息,交互地完成移动客户端和中心服务器中的本地事务验证和移动事务两阶段验证提交.     

一种混合调度协议

一、前言调度器(Soheduler)是分布式数据库中事务并发控制的一部分,它接收事务管理器(TM)发来的操作,实现操作序列的可串行化。根据串行化理论的计算经历论LlJ,经历H是可串行化的当且仅当H的串行图SG(H)是无环的。     

Using tickets to enforce the serializability of multidatabasetransactions

To enforce global serializability in a multidatabase environment the multidatabase transaction manager must take into account the indirect (transitive) conflicts between multidatabase transactions caused by local transactions. Such conflicts are difficult to resolve because the behavior or even the existence of local transactions is not known to the multidatabase system. To overcome these difficulties, we propose to incorporate additional data manipulation operations in the subtransactions of each multidatabase transaction. We show that if these operations create direct conflicts between subtransactions at each participating local database system, indirect conflicts can be resolved even if the multidatabase system is not aware of their existence. Based on this approach, we introduce optimistic and conservative multidatabase transaction management methods that require the local database systems to ensure only local serializability. The proposed methods do not violate the autonomy of the local database systems and guarantee global serializability by preventing multidatabase transactions from being serialized in different ways at the participating database systems. Refinements of these methods are also proposed for multidatabase environments where the participating database systems allow schedules that are cascadeless or transactions have analogous execution and serialization orders. In particular, we show that forced local conflicts can be eliminated in rigorous local systems, local cascadelessness simplifies the design of a global scheduler, and that local strictness offers no significant advantages over cascadelessness     

多数据库系统中的一致性维护

在多数据库环境中存在着全局事务和局部事务,它们必须相互协作,从而为应用程序提供一致性的数据。为了维护多数据库系统（MDBS）的一致性,提出一种事务管理机制。该机制基于扩展事务的原理,对全局子事务和局部事务进行扩展,并为各个局部数据库引进一些控制表。局部数据库管理系统（LDBMS）和局部数据库和控制表之上执行扩展务,这些扩展事务负一局可串行性及事务的恢复。由于它不依赖于LDBMS的各种特征,因此该方法易于实现,是实用的。     

Revisiting Transaction Management in Multidatabase Systems

A lot of research efforts have focused on global serializability, global atomicity, and global deadlocks in multidatabase systems. Surprisingly, however, very few transaction processing model exists that ensures global serializability, global atomicity, and freedom from global deadlocks in a uniform manner. In this paper, we examine previous transaction processing models and propose a new transaction processing model that generates globally serializable and deadlock-free schedules in failure-prone multidatabase systems. A new transaction processing model adopts rigid conflict serializability as a correctness criterion on global serializability, and follows an emulated 2PC, criteria for global commitment, and an abort-based multidatabase recovery scheme for global serializability in failure-prone multidatabase systems. In addition, a deadlock-free policy is suggested where rigid conflict serializability is enforced when each subtransaction, including redo transactions, begins its execution. To practically support a new transaction processing model, Rigid Ticket Ordering (RTO) methods are designed. The proposed transaction processing model has the following improvements: (a) it resolves abnormal direct conflicts identified in this paper, (b) it imposes no restrictions on the execution of local transactions, and (c) it relaxes the restrictions on the execution of global transactions.     

Application Specific Transaction Management in Multidatabase Systems

We present a transaction model for multidatabase systems with autonomous component systems, coined heterogeneous 3-level transactions. It has become evident that in such a system the requirements of guaranteeing full ACID properties and full local autonomy can not be reconciled. In the heterogeneous 3-level transaction model, semantics of actions and specific properties of the architecture of multidatabase systems and of applications are utilized to define application specific compromises between these competing goals. We consider different definitions of conflicts between actions together with application specific sets of allowed (autonomous) local transactions and global subtransactions. A formal model for serializability is given. It is proven that heterogeneous 3-level transactions guarantee all consistency constraints that are ensured in serial executions. In contrast to most other models, we do not require data to be partitioned into global and local data. In particular, heterogeneous 3-level transactions even allow the same data to be updated by local and global transactions in parallel, if these updates are found to be semantically non-conflicting. Recovery is handled by inverse actions. We present a formal framework for this approach which is fully integrated into serializability theory by considering inverse actions as ordinary actions. This has an important impact on the relationship of concurrency control and recovery in our model: By changing the definition of conflicts between actions in order to tailor the model according to application needs, recovery is implicitly affected and no further explicit adaptation of recovery algorithms is necessary. The heterogeneous 3-level transaction model assumes component database systems to support ACID transaction properties. Further properties of local transactions or interfaces of the component database systems are not required. We describe a prototype implementation of heterogeneous 3-level transactions in the object-oriented database system VODAK.     

A theory of global concurrency control in multidatabase systems

This article presents a theoretical basis for global concurrency control to maintain global serializability in multidatabase systems. Three correctness criteria are formulated that utilize the intrinsic characteristics of global transactions to determine the serialization order of global subtransactions at each local site. In particular, two new types of serializability, chain-conflicting serializability and sharing serializability, are proposed and hybrid serializability, which combines these two basic criteria, is discussed. These criteria offer the advantage of imposing no restrictions on local sites other than local serializability while retaining global serializability. The graph testing techniques of the three criteria are provided as guidance for global transaction scheduling. In addition, an optimal property of global transactions for determinating the serialization order of global subtransactions at local sites is formulated. This property defines the upper limit on global serializability in multidatabase systems.     

A non-two-phase locking protocol for global concurrency control indistributed heterogeneous database systems

A concurrency control method is proposed for global transactions in a distributed heterogeneous database system. This method is applicable when the database sites are interconnected in a rooted tree fashion. It guarantees deadlock freedom in addition to serializability. A general architecture of a heterogeneous system is given. The global transaction manager (GTM) decomposes the global transactions initiated at a site and the subtransactions received from other sites into smaller subtransactions, some of which are sent to the GTMs of the other sites, and those remaining, called g-local transactions, are to be executed by the local transaction manager (LTM) at that site. A concurrency control mechanism ensures serializability among: the local transactions (including the g-local transactions of the global ones) at each site, the global transactions and the global and local transactions together     

On rigorous transaction scheduling

The class of transaction scheduling mechanisms in which the transaction serialization order can be determined by controlling their commitment order, is defined. This class of transaction management mechanisms is important, because it simplifies transaction management in a multidatabase system environment. The notion of analogous execution and serialization orders of transactions is defined and the concept of strongly recoverable and rigorous execution schedules is introduced. It is then proven that rigorous schedulers always produce analogous execution and serialization orders. It is shown that the systems using the rigorous scheduling can be naturally incorporated in hierarchical transaction management mechanisms. It is proven that several previously proposed multidatabase transaction management mechanisms guarantee global serializability only if all participating databases systems produce rigorous schedules     

基于事务语义的多数据库系统并发存取控制方法

本文提出了一种多数据库系统（MDBS）的基于事务语义的并发存取控制方法。文中首先按对数据库一致性的影响将事务分类;接着提出了新的MDBS的并发调度的非可串行正确性准则;然后;叙述了称为“事务语义协议”的并发存取控制原理和方法,给出了全局调度和交付的算法和方法正确性证明。