Issue No. 05 - October (1995 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.469835
<p><it>Abstract</it>—Replicated data management systems adopt the 1-copy serializability criteria for processing transactions. In order to achieve this goal, many approaches rely on obtaining votes from other sites for processing update requests. In the proposed approach, a technique for generation of precedence graphs for each transaction execution is analyzed. The transaction data flow graph approach is a fully distributed approach. The proposed technique, is free from deadlocks, and avoids resubmission of transactions.</p>
Availability, distributed algorithms, fault tolerance, nonblocking protocols, reliability, replicated databases, time-critical transactions, serializability.
P. K. Reddy and S. Bhalla, "A Nonblocking Transaction Data Flow Graph Based Protocol For Replicated Databases," in IEEE Transactions on Knowledge & Data Engineering, vol. 7, no. , pp. 829-834, 1995.