2009Unpublished venueRequires access

Queue Sensing Distributed Real-time Commit Protocol: A New Dimension for Distributed Database System

R. B. Patel, Sylvia Vibha

Open publisher page 3 citations

Abstract

The objective of this article is to improve the performance of a transaction in a real time distributed system comprising of heterogeneous networks. For this purpose we have developed a Queue Sensing Distributed Real-Time Commit Protocol (QSDRCP) which ensures the maximum number of transactions is processed before the deadline expires and the ACID property of the transactions executed is preserved. In the design of QSDRCP, various dependencies are considered that exist between the transactions and then determine that if the new incoming transaction can be granted lock. Measures have been taken to enhance the processing speed of the transactions without violating any database constraints that must be enforced. Queue sensing means as soon as a transaction is reaching at a site it is immediately scheduled for the processing and not putting in the wait queue. Further in the presented protocol we are considering percentage of a transaction (low priority) processed before aborting/rescheduling the execution on the arrival of new high priority transaction. A comparative study is also made with some existing protocols. It is found that QSDRCP gives better results.

About this research paper

What this paper is about

The objective of this article is to improve the performance of a transaction in a real time distributed system comprising of heterogeneous networks. For this purpose we have developed a Queue Sensing Distributed Real-Time Commit Protocol (QSDRCP) which ensures the maximum number of transactions is processed before the deadline expires and the ACID property of the transactions executed is preserved. In the design of QSDRCP, various dependencies are considered that exist between the transactions and then determine that if the new incoming transaction can be granted lock. Measures have been taken to enhance the processing speed of the transactions without violating any database constraints that must be enforced. Queue sensing means as soon as a transaction is reaching at a site it is immediately scheduled for the processing and not putting in the wait queue. Further in the presented protocol we are considering percentage of a transaction (low priority) processed before aborting/rescheduling the execution on the arrival of new high priority transaction. A comparative study is also made with some existing protocols. It is found that QSDRCP gives better results.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The objective of this article is to improve the performance of a transaction in a real time distributed system comprising of heterogeneous networks. For this purpose we have developed a Queue Sensing Distributed Real-Time Commit Protocol (QSDRCP) which ensures the maximum number of transactions is processed before the deadline expires and the ACID property of the transactions executed is preserved. In the design of QSDRCP, various dependencies are considered that exist between the transactions and then determine that if the new incoming transaction can be granted lock. Measures have been taken to enhance the processing speed of the transactions without violating any database constraints that must be enforced. Queue sensing means as soon as a transaction is reaching at a site it is immediately scheduled for the processing and not putting in the wait queue. Further in the presented protocol we are considering percentage of a transaction (low priority) processed before aborting/rescheduling the execution on the arrival of new high priority transaction. A comparative study is also made with some existing protocols. It is found that QSDRCP gives better results.

Key concepts: Two-phase commit protocol, Distributed transaction, Compensating transaction, Commit, Computer science, Transaction processing, Database transaction, Queue

Related papers

Back to paper searchBrowse research topicsOriginal source
Queue Sensing Distributed Real-time Commit Protocol: A New Dimension for Distributed Database System — Research Paper | ScholarLens