Author:
Reddy P. Krishna,Bhalla S.
Abstract
Regplicated 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 this paper, a technique for generation of precedence graphs for each transaction execution is proposed. The transaction data flow graph approach is a fully distributed approach. The proposed technique, is free from deadlocks, and avoids resubmission of transactions.
Publisher
Association for Computing Machinery (ACM)