Two-Phase Commit Processing with Restructured Commit Tree

On interoperating incompatible atomic commit protocols in distributed databases

“…This is due to the costs associated with its message complexity (i.e., the number of messages used for coordinating the actions of the different sites) and log complexity (i.e., the frequency at which information is stored onto the stable logs of the participating sites). For this reason, there is a continuous interest in developing more efficient ACPs and optimizations (e.g., [10,7,4,2,13,5,6]), especially in the context of modern electronic services and electronic commerce environments that are characterized by high volume of transactions. Most notable developments are one-phase commit (IPC) protocols [14,4,2].…”

Untitled

“…This is especially important considering that read-only transactions (i.e., retrieval transactions that do not contain any update operations) are the majority of executing transactions in any general database management system. The performance enhancement of the read-only optimization on the overall system performance has been addressed in a number of simulation studies (e.g., [4,16]) although basic analytical evaluations can still reveal the fact of enhanced performance using this optimization (e.g., [14]).…”

Establishing Multi-level Security in Mobile Data Access

“…Even if only one participant votes 'no', the whole transaction is aborted in favour of consistency and atomicity. In distributed computing, factors like message complexity due to network delays, log overloading due to I/O delays, and time complexity of a transaction with regard to reaching a decision may lead to a substantially long execution time, causing thereby problems in preserving the atomicity property [2]. Two-phase locking (2PL), in turn, is a standard technique for coordinating concurrent operations that maintains the integrity and consistency of data by prohibiting conflicting updates from occurring simultaneously [1,3].…”