A nonblocking transaction data flow graph based protocol for replicated databases
P. Krishna Reddy, Subhash Bhalla · IEEE Transactions on Knowledge and Data Engineering · 1995
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.>