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.     

多数据库事务处理原型系统的设计与实现

本文给出了多数据库事务处理原型系统ＭＤＢＳ－１的设计方案，并着重讨论了事务处理核心和局部代理的设计与实现。利用多线索技术来提高事务间的和事务内的并行性，以提高系统的性能。     

On Concurrency Control in Multidatabase Systems with an Extended Transaction Model

A major concurrency control problem that we have to cope in multidatabase systems is the global deadlock detection and resolution problem. This detection must take into account the autonomy of local systems, which make impossible the visibility of the state of local transactions. A well-known approach to detect such deadlocks, called potential global deadlocks, is one based on the potential conflict graph (PCG) appropriate for the multidatabase transaction model with a global commit protocol. This classical transaction model is very constraining for applications manipulating great volumes of information, and where subtransaction terminations (commit or abort) of global transactions are not totally dependant. In this paper we present an effective potential global deadlock characterization, and an efficient potential global deadlock detection algorithm, in multidatabase systems with an extended transaction model more suited for such applications.     

一种多数据库事务模型

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

Query Optimization in Multidatabase Systems

Global query execution in a multidatabase system can be done parallelly, as all the local databases are independent. In this paper, a cost model that considers parallel execution of subqueries for a global query is developed. In order to obtain maximum parallelism in query execution, it is required to find a query execution plan that is represented in the form of a bushy tree and this query tree should be balanced to the maximal possible extent with respect to execution time. A new bottom up approach called Agglomerative Approach (AA) is proposed to construct balanced bushy trees with respect to execution time. By the deterministic nature of this approach, it generates local optimal solutions. This local minima problem will be severe in the case of graph queries, i.e., queries that are represented with a graph structure. A Simulated annealing Approach (SA) is employed to obtain a (near) optimal solution. These approaches (AA and SA) are suitable for handling on-line and off-line queries respectively. A Hybrid Approach (HA), that is an integration of AA and SA, is proposed to optimize queries for which the estimated time to be spent on optimization is known a priori. Results obtained with AA and SA on both tree and graph structured queries are presented.     

Overcoming Heterogeneity and Autonomy in Multidatabase Systems

A multidatabase system (MDBS) is a software system for integration of preexisting and independent local database management systems (DBMSs). The transaction management problem in MDBSs consists of designing appropriate software, on top of local DBMSs, such that users can execute transactions that span multiple local DBMSs without jeopardizing database consistency. The difficulty in transaction management in MDBSs arises due to the heterogeneity of the transaction management algorithms used by the local DBMSs, and the desire to preserve their local autonomy. In this paper, we develop a framework for designing fault-tolerant transaction management algorithms for MDBS environments that effectively overcomes the heterogeneity- and autonomy-induced problems. The developed framework builds on our previous work. It uses the approach described in S. Mehrotra et al. (1992, in “Proceedings of ACM–SIGMOD 1992 International Conference on Management of Data, San Diego, CA”) to overcome the problems in ensuring serializability that arise due to heterogeneity of the local concurrency control protocols. Furthermore, it uses a redo approach to recovery for ensuring transaction atomicity (Y. Breitbart et al., 1990, in “Proceedings of ACM–SIGMOD 1990 International Conference on Management of Data, Atlantic City, NJ;” Mehrotra et al., 1992, in “Proceedings of the Eleventh ACM SIGACT–SIGMOD–SIGART Symposium on Principles of Database Systems, San Diego, CA;” and A. Wolski and J. Veijalainen, 1990, in “Proceedings of the International Conference on Databases, Parallel Architectures and Their Applications”, pp. 321–330), that strives to ensure atomicity of transactions without the usage of the 2PC protocol. We reduce the task of ensuring serializability in MDBSs in the presence of failures to solving three independent subproblems, solutions to which together constitute a complete strategy for failure-resilient transaction management in MDBS environments. We develop mechanisms with which each of the three subproblems can be solved without requiring any changes be made to the preexisting software of the local DBMSs and without compromising their autonomy.     

多数据库系统查询优化算法的研究

介绍了自行研制的panorama多数据库系统的查询优化的实现方法．提出了一种在分布式对象管理体系结构环境下的多数据库系统的动态查询优化技术．在查询优化的执行过程中．使用了基于多元线性回归模型的统计决策机制．由于多数据库的查询优化和模式集成的实现方式也有一定的关系．所以对多数据库系统的模式集成也作了一些描述。     

多数据库系统中基于XIDM的模式映射方法研究

建立多数据库系统中多种模式间的映射是多数据库解决模式异构性的关键,而选用一种适用于这些映射的集成数据模型又是模式映射的基础。为了集成数据库、文件系统、Web文档等多种异构系统中的数据,提出了一种基于XML的集成数据模型（XIDM)作为多数据库系统的公共数据模型,基于XIDM模型,给出了全局模式与输出模式、输出模式与局部模式之间的模式映射方法,并对全局映射和局部映射在多数据库原型系统Panorama中的实现进行了示例,最后从数据模型的集成能力和模式映射的可操作性方面对基于XIDM的模式映射方法进行了性能比较和分析。     

基于XML的文件系统与多数据库系统的集成

文件系统与多数据库系统集成是解决多个分布的异构数据源数据共享的必由之路。本文在对文件系统与多数据库系统集成中的问题进行分析的基础上，提出利用可扩展置标语言XML来实现文件系统与多数据库系统集成，并且提出了一种面向XML Schema的公共数据模型XIDM。XIDM能较好描述无结构化和半结构化数据的数据，建立在一系列XML标准的基础上，具有较强的实用性和通用性。文章还对目前XML的查询语言进行了讨论，确定将扩展的XML－QL作为配合XIDM的查询语言。     

多数据库系统中的全局查询转换方法研究

使用查询树作为查询转换的内部表示,通过使用多数据库规范树对全局查询树进行规范化处理,并给出了相应的转换规则。最后给出了多数据库查询转换算法,并对查询转换的等价性进行了分析。     

Parallel Concurrency Control Activity for Transaction Management in Real-time Database Systems

In a real-time database system, an application supports a mix of transactions. These include the real-time transactions that require completion by a given deadline. Time-critical requirements also exist in many distributed multi-media system applications. Existing concurrency control procedures introduce excessive delays due to non-availability of data resources. In this study, we ignore the delays incurred by ordinary transactions, in order to achieve a non-interference mode of execution (near parallel) for the time-critical transactions. For this purpose, a data allocation model has been studied. It is a stochastic process model based on the use of two-phase locking. It highlights the available possibilities for reductions of delays for time-critical transactions within a distributed real-time database systems. Based on the new conceptual model, modified synchronization techniques for time-critical transactions have been proposed.     

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

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

事务管理器的事务恢复处理

介绍了基于OMG的OTS模型分析并设计了一套保障分布式事务完整性的方案,从而实现了分布式计算的中间层——交易中间件的完整性和可靠性。     

Transaction Scheduling in Distributed Real-Time Systems

Inthis paper, we study the performance of using optimistic approachto concurrency control in distributed real-time database systems(RTDBS). The traditional optimistic approach suffers from theproblem of unnecessary restarts. Transaction restarts can significantlyincrease the system workload and intensify resource and datacontention. In distributed environments, the complexity of thesystem and the high communication overhead exacerbate the problem.Therefore, the number of unnecessary restarts is the determinantfactor that affects the performance of optimistic approach indistributed RTDBS. When optimistic approach is extended to distributedenvironments, a number of issues resulting from the increasedcomplexity and communication overhead have to be resolved. Inthis paper, a new real-time distributed optimistic concurrencycontrol (DOCC) protocol with dynamic adjustment of serializationorder (DASO), called DOCC-DA is proposed. This protocol can avoidunnecessary transaction restarts by dynamically adjusting theserialization order of the conflicting transactions. Therefore,resources can be saved and more transactions can meet their deadlines.In the DOCC-DA protocol, a new distributed circular validationscheme is included to facilitate transaction validation in distributedenvironments. The performance of the DOCC-DA protocol has beenexamined in detail by simulation. The results showed that theperformance of the DOCC-DA protocol is consistently better thanthat of other protocols.     

Flexible Transaction Dependencies in Database Systems

Numerous extended transaction models have been proposed in the literature to overcome the limitations of the traditional transaction model for advanced applications characterized by their long durations, cooperation between activities and access to multiple databases (like CAD/CAM and office automation). However, most of these extended models have been proposed with specific applications in mind and almost always fail to support applications with slightly different requirements.We propose the Multiform Transaction model to overcome this limitation. The multiform transaction model supports a variety of other extended transaction models. A multiform transaction consists of a set of component transactions together with a set of coordinators which specify the transaction completion dependencies among the component transactions. A set of transaction primitives allow the programmer to define custom completion dependencies. We show how a wide range of extended transactions can be implemented as multiform transactions, including sagas, transactional workflows, nested transactions, and contingent transactions. We allow the programmers to define their own primitives—having very well-defined interfaces—so that application specific transaction models like distributed multilevel secure transactions can also be supported.     

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.     

数据管理在学生档案系统的应用

对学生进行档案的管理,对很多学校来说已经不是新鲜事情了,但是如何能够最大程度上的利用计算机系统进行管理,并且这些管理的数据存储方面的要点是本文要去解决的关键。文章是从为什么要对学生管理系统如此重视开始谈起的,重点对数据存储的重要性进行了分析。     

面向对象数据库中的事务标识分配策略

在深入分析嵌套事务模型下事务处理对事务标识的需求的基础上,提出了一系列实用有效的分配策略。其中,混合策略实际应用于自行研制的面向对象数据库系统ＫＤＯＯＤＢ中。