Streamlining Transaction Commit for Distributed Databases with Thomas's Write Rule

Vipul Kumar Bondugula

doi:10.36948/ijfmr.2023.v05i04.44253

Streamlining Transaction Commit for Distributed Databases with Thomas's Write Rule

Author(s)	Vipul Kumar Bondugula
Country	India
Abstract	Basic Timestamp Ordering (BTO) is a concurrency control mechanism in database management systems (DBMS) that ensures serializability by assigning a unique timestamp to each transaction. The core idea is that transactions are executed in the order of their timestamps. If the system detects a conflict based on timestamp order, it will take corrective action, such as rolling back a transaction to ensure the consistency of the database. One of the key challenges with Basic Timestamp Ordering is handling conflicts efficiently. For example, if two transactions are trying to write to the same data item, the one with the older timestamp is allowed to proceed, while the other is aborted and must be restarted. This approach can lead to an increased number of rollbacks, especially in environments with high contention. Another issue with BTO is that it requires the DBMS to track the timestamps for all transactions, which can be complex and resource-intensive. In large-scale distributed systems, the overhead of timestamp management can become a bottleneck. Additionally, BTO does not allow for fine-grained conflict resolution. In some cases, a transaction may be unnecessarily rolled back, even if it could have been completed without violating consistency, leading to wasted resources. Furthermore, Basic Timestamp Ordering does not address deadlock scenarios, where transactions wait indefinitely for resources held by others. While BTO can prevent some forms of conflict, it does not provide an inherent mechanism for deadlock detection and resolution. This limitation further complicates the overall performance and scalability of the system. Finally, Basic Timestamp Ordering (BTO) faces difficulties when dealing with long-running transactions or transactions that have multiple dependencies. The longer a transaction runs, the higher the chance it will conflict with other concurrently executing transactions, leading to an increased rate of aborts and retries. These repeated transaction aborts can severely degrade system performance, especially when dealing with high workloads in distributed environments. The need for constant conflict resolution further strains the system, making it less suitable for high-volume, complex transaction processing. This is having the issues with number of aborts. This paper addresses this issue by working with Thomas’s Write Rule.
Field	Engineering
Published In	Volume 5, Issue 4, July-August 2023
Published On	2023-08-09
DOI	https://doi.org/10.36948/ijfmr.2023.v05i04.44253
Short DOI	https://doi.org/g9hnp2

View / Download PDF File

E-ISSN 2582-2160

doi

CrossRef DOI is assigned to each research paper published in our journal.

IJFMR DOI prefix is
10.36948/ijfmr

Downloads

Research Paper Format Copyright Permission Form and Undertaking Form Cover Page Vol 7 Isu 2 Cover Page Vol 7 Isu 1 Cover Page Vol 6 Isu 6

All research papers published on this website are licensed under Creative Commons Attribution-ShareAlike 4.0 International License, and all rights belong to their respective authors/researchers.

CC-BY-SA

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9687-828-838	editor@ijfmr.com

International Journal For Multidisciplinary Research

A Widely Indexed Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal

Streamlining Transaction Commit for Distributed Databases with Thomas's Write Rule

Share this