A classification of transaction processing systems

The problems in building a transaction processing system are discussed, and it is shown that the difficulties are a function of specific attributes of the underlying database system. A model of a transaction processing system is presented, and five system dimensions important in classifying transaction processing systems-the process, machine, heterogeneity, data, and site components-are introduced. The specific problems posed by various combinations of system characteristics are analyzed. The evolution of transaction processing systems are described in terms of the framework     

Heterogeneous and autonomous transaction processing

The problems specific to heterogeneous and autonomous transactions processing (HATP) systems are discussed. HATP is divided into three dimensions: distribution, heterogeneity, and autonomy. The authors regard the three dimensions as independent, and they present concrete design and implementation techniques to support this view     

A model for adaptable systems for transaction processing

Adaptability is an essential tool for managing escalating software costs and to build high-reliability, high-performance systems. Algorithmic adaptability, which supports techniques for switching between classes of schedulers in distributed transaction systems, is modeled. RAID, an experimental system implemented to support experimentation in adaptability, is discussed. Adaptability features in RAID, including algorithmic adaptability, fault tolerance, and implementation techniques for an adaptable server-based design, are modeled     

Large scale interoperability and distributed transaction processing

This article integrates an interoperability architecture, the OSCA^TM architecture, and a distributed transaction processing protocol, the X/Open^® Distributed Transaction Processing model, into a unified model of large scale interoperability and distributed transaction processing. Applications supporting different business operations are often deployed in heterogeneous environments in which applications are stand alone islands and operations are fragmented. But in order to have integrated operations, a loosely coupled system of autonomous applications is required often bound together via a distributed transaction processing protocol. This article describes a model for this configuration. It will propose that the span of control of a transaction manager defines the transaction environment for a single application. Any two applications need not conform to the same supplier's transaction environment nor reside in the same environment. Interoperability must be provided among applications, since any one application cannot assume that any other application is under the control of the same transaction manager. Requirements are imposed upon the interactions of applications to support interoperability. The interface between transaction managers must be compatible with these requirements. Other distributed architecture standards must define the requirements for release independence, resource independence, accessibility transparency, location transparency, contract interfaces, and secure environment.     

Blocking analysis of transaction processing queues

A transaction processing queue manages a database which is partitioned into N items. Each arriving class-i customer requests to read and write a certain subset of the N items (called the shared and exclusive access sets and ). Classes i and j are said to conflict if

Full-size image

. No two conflicting classes of customers can be processed simultaneously. All classes arrive according to independent Poisson processes and have general i.i.d. service times.In this paper, we discuss database systems without queuing. We show the insensitivity property of the system, and derive analytical expressions for performance measures such as blocking probabilities, throughput, etc.     

Adding fault-tolerant transaction processing to LINDA

To simplify the difficult task of writing fault-tolerant parallel software, we implemented extensions to the basic functionality of the LINDA or tuple-space programming model. Our approach implements a mechanism of transaction processing to ensure that tuples are properly handled in the event of a node or communications failure. If a process retrieving a tuple fails to complete processing or a tuple posting or retrieval message is lost, the system is automatically rolled back to a previous stable state. Processing failures and lost messages are detected by time-out alarms. Roll-back is accomplished by reposting pertinent tuples. Intermediate tuples produced during partial processing are not committed or made available until a process completes. In the absence of faults, system overhead is low. The fault-tolerance mechanism is implemented at the system level and requires little programmer effort or expertise. Two implementations of the model are discussed, one using a UNIX network of workstations and one using a Transputer network. Data measuring model overhead and some aspects of system performance in the presence of faults is presented for an example system.     

Eliminating unscalable communication in transaction processing

Multicore hardware demands software parallelism. Transaction processing workloads typically exhibit high concurrency, and, thus, provide ample opportunities for parallel execution. Unfortunately, because of the characteristics of the application, transaction processing systems must moderate and coordinate communication between independent agents; since it is notoriously difficult to implement high performing transaction processing systems that incur no communication whatsoever. As a result, transaction processing systems cannot always convert abundant, even embarrassing, request-level parallelism into execution parallelism due to communication bottlenecks. Transaction processing system designers must therefore find ways to achieve scalability while still allowing communication to occur. To this end, we identify three forms of communication in the system—unbounded, fixed, and cooperative—and argue that only the first type poses a fundamental threat to scalability. The other two types tend not impose obstacles to scalability, though they may reduce single-thread performance. We argue that proper analysis of communication patterns in any software system is a powerful tool for improving the system’s scalability. Then, we present and evaluate under a common framework techniques that attack significant sources of unbounded communication during transaction processing and sketch a solution for those that remain. The solutions we present affect fundamental services of any transaction processing engine, such as locking, logging, physical page accesses, and buffer pool frame accesses. They either reduce such communication through caching, downgrade it to a less-threatening type, or eliminate it completely through system design. We find that the later technique, revisiting the transaction processing architecture, is the most effective. The final design cuts unbounded communication by roughly an order of magnitude compared with the baseline, while exhibiting better scalability on multicore machines.     

A snapshot of trusted personal devices applicable to transaction processing

In recent years, a clear trend has emerged where businesses need to provide flexible access to its services so as to increase their usage by a much wider cross-section of users operating over public infrastructures but still within a trusted environment. This trusted environment must be established between all participating users and service provider entities before any transactions are carried out. To meet the challenge of enabling mobile users to work within a trusted environment on any untrusted machine, the notion of a trusted personal device (TPD) has emerged. This paper provides a survey giving a snapshot of the growing body of work ongoing in the area of TPDs and the services they support.     

一种新的混合实时事务并发控制算法

单一的实时事务并发控制策略因为对事务性能以及事务对数据的访问方式有着特殊限制而无法满足不同类型事务同时并存的混合实时数据库的要求.针对不同类型实时事务特征,提出了一种新的混合实时事务并发控制算法,对不同类型实时事务采用不同并发控制策略,具有极强的针对性和自适应性,算法同时通过分析数据的相关语义,利用数据相似性定义,合理放宽可串行化的正确性标准,在优先考虑硬实时事务的前提下,尽可能增加软实时事务成功提交的比例以提高系统整体性能.仿真实验结果证明MRTT_CC算法性能良好.     

移动数据库事务处理模型的研究

在移动数据库系统中,事务的移动性、频繁断接性以及长事务等特性使得传统的事务处理模式不再适用。提出一种扩展的乐观两阶段提交事务处理模型（O2PC-MT）,该模型吸收了O2PC-MT模型的设计思想,解决了由短暂的通信失效造成不必要的事务中止以及移动事务协调器故障导致的阻塞等问题。实验结果表明,与O2PC-MT事务处理模型相比,EO2PC-MT提高了系统的事务吞吐率以及改善了系统的总体性能。     

Appraisal and reporting of security assurance at operational systems level

In this paper we discuss the issues relating the evaluation and reporting of security assurance of runtime systems. We first highlight the shortcomings of current initiatives in analyzing, evaluating and reporting security assurance information. Then, the paper proposes a set of metrics to help capture and foster a better understanding of the security posture of a system. Our security assurance metric and its reporting depend on whether or not the user of the system has a security background. The evaluation of such metrics is described through the use of theoretical criteria, a tool implementation and an application to a case study based on an insurance company network.     

A strawman reference model in transaction processing for an object-oriented database

This position paper provides a strawman reference model which can be used to compare and reason about transaction management in an Object-Oriented Data Base system (OODB). The model is described as consisting of a collection of characteristics that can be used for comparing existing and future features in transaction management of an OODB. Some of the features in this collection are really alternatives to one another. The purpose of inclusion of these alternatives is to help the evaluation process when developing standards.     

NXD数据库事务机制的研究

原生XML数据库(NXD)的事务处理机制是保障数据库正常运行的核心机制,是当前研究的一个重点.在分析了现事务处理机制的基础上,结合关系数据库中成熟的封锁理论,提出基于XPath的XPL四种锁封锁机制,对数据库的操作和事务做出了明确的定义,并给出了实例进行验证说明.     

A hybrid distributed optimistic concurrency control method for high-performance real-time transaction processing

The conventional lock scheme tends to suffer from a cascade of blockings,while the optimistic concurrency control(OCC) scheme may suffer from wasting resources.To overcome these problems,some researchers have proposed a combination of OCC and lock in transaction processing.Using this method,Thomasian proposed the hybrid method for conventional distributed transaction processing,and Lam proposed the DOCC-DA protocol for distributed realtime databased system based on forward validation.This paper proposes a new protocol,called Hybrid Distributed Optimistic Concurrency COntrol Embedded in two-Phase Commit,which is based on back validation.The new protocol makes use of access invariance and runtime inforbased on back validation.The new protocol makes use of access invariance and runtime infor mation which can guarantee a rerun transaction to meet its deadline and abort the fruitless run transactions as early as possible.A series of simulation experiments have been done to investigate the performance of the new protocol.The results show that its performance is consitently better than that of other protocols.     

Blocking reduction for distributed transaction processing within MANETs

Atomic commit protocols for distributed transactions in mobile ad-hoc networks have to consider message delays and network failures. We consider ad-hoc network scenarios, in which participants hold embedded databases and offer services to other participants. Services that are composed of several other services can access and manipulate data of physically different databases. In such a scenario, distributed transaction processing can be used to guarantee atomicity and serializability throughout all databases. However, with problems like message loss, node failure, and network partitioning, mobile environments make it hard to get estimations on the duration of a simple message exchange. In this article, we focus on the problem of setting up reasonable time-outs when guaranteeing atomicity for transaction processing within mobile ad-hoc networks, and we show the effect of setting up “wrong” time-outs on the transaction throughput and blocking time. Our solution, which does not depend on time-outs, shows a better performance in unreliable networks and remarkably reduces the amount of blocking.     

Advanced transaction processing in multilevel secure file stores

The concurrency control requirements for transaction processing in a multilevel secure file system are different from those in conventional transaction processing systems. In particular, there is the need to coordinate transactions at different security levels avoiding both potential timing covert channels and the starvation of transactions at higher security levels. Suppose a transaction at a lower security level attempts to write a data item that is being read by a transaction at a higher security level. On the one hand, a timing covert channel arises if the transaction at the lower security level is either delayed or aborted by the scheduler. On the other hand, the transaction at the high security level may be subjected to an indefinite delay if it is forced to abort repeatedly. This paper extends the classical two-phase locking mechanism to multilevel secure file systems. The scheme presented here prevents potential timing covert channels and avoids the abort of higher level transactions nonetheless guaranteeing serializability. The programmer is provided with a powerful set of linguistic constructs that supports exception handling, partial rollback, and forward recovery. The proper use of these constructs can prevent the indefinite delay in completion of a higher level transaction, and allows the programmer to trade off starvation with transaction isolation     

A multi-user operating system for transaction processing,written in Concurrent Pascal

This paper presents a medium-sized operating system written in Concurrent Pascal, thereby describing further experience with this language and giving further indications of its scope. The operating system was developed to support an application in the area that is usually termed ‘commercial’ or ‘administrative’. Both the functional capabilities and the structure of the operating system are described, with emphasis on its facilities for data file management, and its size and performance are given. A secondary theme of the paper is the relationship of the operating system's qualities to the properties and facilities of the programming language Concurrent Pascal used for its development.     

Model theory approach to transaction processing system development

This paper presents a new approach, model theory approach, to small and medium scale transaction processing system (TPS) development. A TPS of this paper is an information system designed to process day-to-day business event data at operational level of an organization. The paper is not concerned with data base construction but with transaction processing.

The model theory approach is not a software engineering approach but a systems theory approach. In the approach a model of the target system, which is called a user model, is constructed in set theory using a formal system structure of a TPS. The user model is, then, compiled into an extended Prolog (extProlog) model. The extProlog is an extension of Prolog to meet requirements for management information system development. On compilation a standardized user interface (UI) called internal UI is attached. The extProlog model with the internal UI is, then, executed under control of another standardized UI called an external UI. Implementation is an integral part of the approach. Because the UIs are designed for the formalized (abstract) structure of a TPS, they can be standardized and are provided as black box components to system development. Because a systems developer is required to only build a user model in set theory based on a model theoretic structure in the approach, it is called a model theory approach. Advantages of this approach are that it provides a theoretical structure to information systems development so that systems development can be made an engineering discipline, and facilitates rapid systems development.