• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.543-552
• /
• 2001

To process transactions in fully replicated database, an atomic broadcast is mainly used. In this case of using atomic broadcast, transactions can be delayed because of the coordinating step among servers before processing the transaction. In this paper, we propose an algorithm to resolve the problem of transaction delay. In the proposed algorithm, the transactions are processed by using the optimistic method. The operations of a transaction are performed in the site that it is submitted and its write operations its updates atomically in all replicated sites. Since the serializability of transaction is ensured by checking the sequence number of transactions in the completion-inspection step.