Transaction processing in partially replicated databases

Single master lazy updates propagation methods guarantee weakly consistency for increasing the read availability, but have more chances for update conflicts. We propose an update propagation method based on the balanced tree of replicas in the partially replicated database. The proposed method effectively resolves non-serializabilty resulted from the conflicts of a propagation-transaction and a transaction due to the lazy propagation. To resolve the non-serializable execution, Our method uses the timestamp and the information of the RCTL(the most Recent Committed update-Trans action List) in the status database. We made an experiment on the performance evaluation of our algorithm through the simulation, and proved that it has good performance due to reducing the abort ratio of transactions.