DocumentCode
2452257
Title
Rules for Deriving Efficient Independent Transaction
Author
Ibrahim, Hamidah
Author_Institution
Dept. of Comput. Sci., Univ. Putra Malaysia, Serdang
Volume
2
fYear
0
fDate
0-0 0
Firstpage
2903
Lastpage
2908
Abstract
A transaction is a collection of operations that performs a single logical function in a database application. Each transaction is a unit of both atomicity and consistency. Thus, transactions are required not to violate any database consistency constraints. In most cases, the update operations in a transaction are executed sequentially. The effect of a single operation in a transaction potentially may be changed by another operation in the same transaction. This implies that the sequential execution sometimes does some redundant work. A transaction with a set of update operations is order dependent if and only if the execution of the transaction following the serialisability order as in the transaction produce an output which is different than the output produced by interchanging the operations in the transaction. In "enforcement of integrity constraints against transactions with transition axioms" by Sang et al. (1992), a transaction is an order dependent transaction if and only if it contains at least two conflicting update operations, i.e. updates that operate on the same data item. In our work, we have identified that there are cases where an update operation operates on a data item that is part of a set of data items operate by the other update operation. Such transaction is known as partly order dependent transaction. An order independent transaction has an important advantage of its update statements being executed in parallel without considering their relative execution orders. With an order independent transaction we can consider its single updates in an arbitrary order. Furthermore, executing these update operations in parallel can reduce the execution time. In this paper, we present rules that can be applied to generate order independent transaction given an order dependent or partly order dependent transaction. In addition, we have identified several rules that can be applied to eliminate redundant and subsumed operations that can incur unnecessary execu- - tion cost
Keywords
database management systems; transaction processing; data item set; database application; database consistency constraint; logical function; order independent transaction; parallel update operation; partly order dependent transaction; redundant operation; sequential execution order; update statement; Costs; Data processing; Database systems; Delay; Fault diagnosis; Information technology; Memory; Prototypes; Throughput; Transaction databases;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Communication Technologies, 2006. ICTTA '06. 2nd
Conference_Location
Damascus
Print_ISBN
0-7803-9521-2
Type
conf
DOI
10.1109/ICTTA.2006.1684874
Filename
1684874
Link To Document