Analysis of the Probability of Transaction Abort and Throughput of Two Timestamp Ordering Algorithms for Database Systems
Issue No. 02 - June (1991 vol. 3)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.88007
<p>The author analyzes and compares the performance of two timestamp ordering concurrency control algorithms, namely, the basic and multiversion, for database systems. The multiversion algorithm improves the performance of the basic timestamp ordering algorithm by keeping multiple versions of data objects. The author discusses the performance enhancement in the multiversion algorithm over the basic algorithm. The author also discusses the storage overhead due to multiple versions of data objects in the multiversion algorithm. The exact performance model of these algorithms is so complex that it is impossible to find a closed-form solution. The author reduces the complexity of the analysis by analyzing a single transaction in isolation and reflects the presence of other transactions on the isolated transaction by the probability of conflict/abort. The analysis provides useful insight into the performance of these algorithms.</p>
transaction abort; timestamp ordering algorithms; database systems; timestamp ordering concurrency control algorithms; multiversion algorithm; basic timestamp ordering algorithm; performance enhancement; storage overhead; multiversion algorithm; exact performance model; closed-form solution; conflict/abort; concurrency control; distributed databases; transaction processing
M. Singhal, "Analysis of the Probability of Transaction Abort and Throughput of Two Timestamp Ordering Algorithms for Database Systems," in IEEE Transactions on Knowledge & Data Engineering, vol. 3, no. , pp. 261-266, 1991.