Rules for deriving efficient independent transaction
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...
| Main Author: | |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
IEEE
2006
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/48112/1/Rules%20for%20deriving%20efficient%20independent%20transaction.pdf |
| _version_ | 1796974922468163584 |
|---|---|
| author | Ibrahim, Hamidah |
| author_facet | Ibrahim, Hamidah |
| author_sort | Ibrahim, Hamidah |
| collection | UPM |
| description | 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 serialibility order as in the transaction produce an output which will be different than the output produced by interchanging the operations in the transaction. In [8], 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 execution cost. |
| first_indexed | 2024-03-06T09:04:04Z |
| format | Conference or Workshop Item |
| id | upm.eprints-48112 |
| institution | Universiti Putra Malaysia |
| language | English |
| last_indexed | 2024-03-06T09:04:04Z |
| publishDate | 2006 |
| publisher | IEEE |
| record_format | dspace |
| spelling | upm.eprints-481122016-08-03T08:05:27Z http://psasir.upm.edu.my/id/eprint/48112/ Rules for deriving efficient independent transaction Ibrahim, Hamidah 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 serialibility order as in the transaction produce an output which will be different than the output produced by interchanging the operations in the transaction. In [8], 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 execution cost. IEEE 2006 Conference or Workshop Item PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/48112/1/Rules%20for%20deriving%20efficient%20independent%20transaction.pdf Ibrahim, Hamidah (2006) Rules for deriving efficient independent transaction. In: 2nd International Conference on Information and Communication Technologies: From Theory to Applications (ICTTA 2006), 24-28 Apr. 2006, Damascus, Syria. (pp. 2903-2908). 10.1109/ICTTA.2006.1684874 |
| spellingShingle | Ibrahim, Hamidah Rules for deriving efficient independent transaction |
| title | Rules for deriving efficient independent transaction |
| title_full | Rules for deriving efficient independent transaction |
| title_fullStr | Rules for deriving efficient independent transaction |
| title_full_unstemmed | Rules for deriving efficient independent transaction |
| title_short | Rules for deriving efficient independent transaction |
| title_sort | rules for deriving efficient independent transaction |
| url | http://psasir.upm.edu.my/id/eprint/48112/1/Rules%20for%20deriving%20efficient%20independent%20transaction.pdf |
| work_keys_str_mv | AT ibrahimhamidah rulesforderivingefficientindependenttransaction |