P2P多数据库系统中的事务并发控制研究

P2P多数据库系统是一种分布式的数据库系统,它是P2P计算系统和传统数据库系统的结合体.P2P计算系统的动态性使得P2P多数据库系统的事务管理缺少全局控制机制.在事务传播过程不存在循环的前提下,文章提出了一种保证P2P多数据库系统中事务全局串行化的并发控制协议,它通过控制一系列全局事务传播过程中每个熟识关系的两级串行化来实现.     

国防科技大学计算机学院工学博士学位论文摘要

多数据库系统中关键技术的研究作者 :韩伟红 ( 2 0 0 0 .1 0 )导师 :杨晓东教授本文通过对多库系统中几个关键技术的研究 ,提出了新的解决方法和算法 ,弥补了目前多库系统研究领域的某些不足。针对多库系统结构复杂、实现困难的问题 ,本文提出并实现了基于ＣＯＲＢＡ的面向对象多库系统体系结构及多库系统中间件思想 ,将分布式对象技术引入多库系统之中 ,为多库系统提供了先进的面向对象程序设计方法和技术 ,大大提高了系统的可管理性、可维护性、可伸缩性和可集成性等 ,使多库系统的开发和使用变得相对简单。本文针对目前多库系统中并发控…     

关系型多数据库系统IS-Global的设计与实现

文章主要讨论IS-Global的设计思想和关键的实现技术.IS-Global是一个关系型多数据库系统,其目标是为CIMS(computer integrated manufacture system)环境下企业级应用提供一个集成的、能屏蔽网络、操作系统和数据库系统异构性的全局信息系统.IS-Global的主要特点是：(1) 它是一个紧耦合的系统,具有统一的全局模式,对不同的关系型数据库系统,如Oracle,Sybase和SQL(structured query language) Server等可进行透明访问.(2) IS-Global采用两级客户/服务器结构,支持并发控制和安全性机制,是一个多用户系统.(3)可同时提供图形化界面工具、ODBC(open database connectivity)函数接口和SQL语言交互式访问接口.(4) 能同时支持对多个局部数据库中数据的联合查询.     

安全数据库系统层次事务的并发控制

本文通过分析安全数据库系统及层次事务并发控制的特点，提出了多复本安全数据库系统层次事务并发控制模式，该模式改各子数据库系统单层并发控制机构为多层并发控制机构，增加各子系统的并发度，从而提高了整个系统的效率。     

基于双重库结构的数据库系统容错设计技术

本文在传统差分文件技术的基础上提出了一种采用双重库结构的数据库系统容错设计新技术,并将其实际应用于多个信息系统的设计中。这些系统除了完成正常的事务管理(包括数据维护)功能外,还具有独特的适用于微型机环境的可靠性控制及完整性控制功能。理论和实践表明,基于双重库结构的数据库系统具有良好的可靠性和完整性性能。该项数据库容错技术可推广至微型机DBMS及数据库应用系统的设计中。     

实现异构数据库集成的一种方法——元数据库法

本文提出的元数据库系统ＭＤＢＳ是一个基于知识库的联邦数据库系统，通过集中管理各异构数据库中的元数据，支持多库间的数据共享、交互操作及自治。在整个集成系统中无全局模式，异构数据库模式间的结构和语义冲突，由ＭＤＢＭＳ通过访问元数据库中有关各局部库的模式信息和模式转换规则来解决。ＭＤＢＳ利用知识来描述应用系统的数据流信息和控制信息支持集成应用系统的实现。本文着重论述了ＭＤＢＳ的数据模型、数据库模式和ＭＤＢＳ实现的技术问题。     

组态软件实时数据库系统研究及设计

利用Windows的DLL(动态连接库)和全局共享内存技术来建立系统实时数据库的设计思想,采取传统数据库系统、文件系统和内存数据库系统兼用,利用多种存储介质来构造系统的实时数据库系统,并通过给用户提供一套接口标准——实时数据库系统接口,来实现I/O驱动程序与用户程序和实时数据库系统间的高速数据传递。     

在多数据库系统中维护完整性约束

在多数据库系统中,需要维护全局完整性约束,针对这一问题,本文提出了将主动机制集成到多数据库系统中以维护全局完整性约束的方法,并给出了具体的实例,由于主动规则与系统无关,因此该方法具有很大的灵活性。     

一种适合多数据库系统的查询表示方法

1 引言随着分布计算和网络技术的不断发展,传统的数据库技术已越来越不能满足数据共享和互操作的需要。同时,已有的数据库系统又不可能全部丢弃.因而研制能同时访问和处理来自多个数据库中数据的多数据库系统已成为必然趋势。多数据库系统是解决已存的、异构的、分布的多个局部数据库系统之间数据共享和集成的问题。由于多数据库系统具有异构性、分布性和局部自治性的特点,使得多数据库查询处理与传统数据库查询处理有很大的不同。多数据库系统呈现给用户的是全局模式,用户使用全局查询语言提交对多数据库的查询,而所需的数据又必须从各局部数据库获得,所以必须将全局查询转换成与局部数据库对应的局部查询。在全局查询转换为局部查询的过程中,需要     

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

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

Supporting consistent updates in replicated multidatabase systems

Replication is useful in multidatabase systems (MDBSs) because, as in traditional distributed database systems, it increases data availability in the presence of failures and decreases data retrieval costs by reading local or close copies of data. Concurrency control, however, is more difficult in replicated MDBSs than in ordinary distributed database systems. This is the case not only because local concurrency controllers may schedule global transactions inconsistently, but also because local transactions (at different sites) may access the same replicated data. In this article, we propose a decentralized concurrency control protocol for a replicated MDBS. The proposed strategy supports prompt and consistent updates of replicated data by both local and global applications without a central coordinator.     

An extended transaction to maintain consistency and recovery in multidatabase systems

A complete practical solution to transaction management preserving multidatabase consistency in the presence of multidatabase updates and failures is presented. The approach developed does not require support for the two-phase commit (2PC) protocol in the participating local database management systems (LDBMSs). Furthermore, it does not violate local autonomy; the source code of the LDBMSs is not modified in any way and the multidatabase system (MDBS) does not access or modify any control information of the LDBMS. The principles of the 2PC protocol in the process of global transaction commitment are adopted. The presented method does not rely on any specific concurrency control mechanism for LDBMSs. Consideration is given to global transaction failures due to subtransaction aborts by the LDBMSs and local site crashes. The recovery process is based on undo operations. While a global transaction is in progress, the tables accessed by subtransactions of this transaction at each local site are locked using specially initiated table locks. These locks are stored and maintained in the local database itself as control tables. The approach taken is easy to implement, and its limitations are discussed.     

Overview of multidatabase transaction management

A multidatabase system (MDBS) is a facility that allows users access to data located in multiple autonomous database management systems (DBMSs). In such a system,global transactions are executed under the control of the MDBS. Independently,local transactions are executed under the control of the local DBMSs. Each local DBMS integrated by the MDBS may employ a different transaction management scheme. In addition, each local DBMS has complete control over all transactions (global and local) executing at its site, including the ability to abort at any point any of the transactions executing at its site. Typically, no design or internal DBMS structure changes are allowed in order to accommodate the MDBS. Furthermore, the local DBMSs may not be aware of each other and, as a consequence, cannot coordinate their actions. Thus, traditional techniques for ensuring transaction atomicity and consistency in homogeneous distributed database systems may not be appropriate for an MDBS environment. The objective of this article is to provide a brief review of the most current work in the area of multidatabase transaction management. We first define the problem and argue that the multidatabase research will become increasingly important in the coming years. We then outline basic research issues in multidatabase transaction management and review recent results in the area. We conclude with a discussion of open problems and practical implications of this research.     

Query optimization via contention space partitioning and cost error controlling for dynamic multidatabase systems

A multidatabase system (MDBS) integrates information from multiple autonomous local databases. Performing global query optimization to achieve efficient query processing in such a system is challenging due to local autonomy of the data sources. Dynamic factors in the environment make the problem even more difficult. In this paper, we present two techniques, i.e., contention space partitioning and cost error controlling, to perform global query optimization in a dynamic MDBS. Both techniques generate an execution plan with multiple versions for a query in a dynamic MDBS, utilizing the multistate cost models built for the dynamic environment via our previous multistate query sampling method. The first technique partitions the contention space of a dynamic multidatabase environment into a given number of subspaces and chooses a good query execution plan version for each subspace, while the second technique selects a set of execution plan versions by using a given error tolerance to control query execution costs. Experiments demonstrate that the proposed techniques are quite promising for performing global query optimization in a dynamic MDBS. Compared with related work on dynamic query optimization, our approach has an advantage of avoiding the high overhead for modifying or re-generating an execution plan for a query based on dynamic runtime information. Research was supported by the US National Science Foundation under Grant # IIS-9811980 and The University of Michigan.     

协同虚拟环境中的并发控制机制

针对协同虚拟环境（CVE）并发控制在一致性、响应性和并发性之间存在的矛盾,提出一种基于客户端的并发控制机制。该机制通过在客户端保存共享物体的状态信息,使系统的一致性得到提高,利用基于对象属性的并发控制思想,提高系统的响应性。实验表明,该并发控制机制能使CVE系统在一致性、响应性和并发性等方面达到较好的平衡。     

Solving Local Cost Estimation Problem for Global Query Optimization in Multidatabase Systems

To meet users' growing needs for accessing pre-existing heterogeneous databases, a multidatabase system (MDBS) integrating multiple databases has attracted many researchers recently. A key feature of an MDBS is local autonomy. For a query retrieving data from multiple databases, global query optimization should be performed to achieve good system performance. There are a number of new challenges for global query optimization in an MDBS. Among them, a major one is that some local optimization information, such as local cost parameters, may not be available at the global level because of local autonomy. It creates difficulties for finding a good decomposition of a global query during query optimization. To tackle this challenge, a new query sampling method is proposed in this paper. The idea is to group component queries into homogeneous classes, draw a sample of queries from each class, and use observed costs of sample queries to derive a cost formula for each class by multiple regression. The derived formulas can be used to estimate the cost of a query during query optimization. The relevant issues, such as query classification rules, sampling procedures, and cost model development and validation, are explored in this paper. To verify the feasibility of the method, experiments were conducted on three commercial database management systems supported in an MDBS. Experimental results demonstrate that the proposed method is quite promising in estimating local cost parameters in an MDBS.     

NCS中实时数据库的多版本并发控制研究

实时数据库是网络控制系统(NCS)的重要组成部分,是整个控制系统中数据交换的平台。本文在原有的两段锁机制的基础上,提出一种适用于多版本的两段锁并发控制方法。简述数据多版本给现场控制带来的不利影响。分析在数据多版本的情况下,现场事务的可串行性,用多版本并发控制协议MV2PL解决多版本并发控制问题。用简化的多版本并发协议2V2PL说明它的正确性,并通过实例表明该协议是可行的。     

分布式数据库并发控制方法研究

并发控制机制是数据库事务管理中重要的组成部分，是衡量一个数据库系统功能强弱和性能好坏的重要标志之一。分布式并发控制的目的是保证分布事务和分布式数据库的一致性，实现分布事务的可串行性，使事务具有良好的并发度以保证系统具有用户满意的效率。本文首先就分布式数据库并发事务的可串行化进行探讨并在此基础上提出分布式数据库并发控制的基本方法。     

并行实时数据库系统中的一种自适应并发控制模式

根据事务的实时性及关键性分类,事务分为硬实时、固实时、软实时和非实时事务。传统的并发控制仅考虑其中一到两种事务,且将固／软实时事务统一为软实时事务考虑,带有很大的不精确性,这将降低系统吞吐率。为此,本文提出了一种自适应并发控制模式。该模式采用两级并发控制体系,一级是主并发控制器,探测不同类事务间可能存在
在的类间数据冲突;二级是从并发控制器,探测同类事务间可能存在的类内数据冲突,由四类从并发控制器实现。根据各类事务的不同特征,各控制器采用的策略不同,因而具有极大的自适应性并能最终提高系统的吞吐率,但需要增加额外的硬件开销。