This paper proposes a new primary lazy update protocol, PTCS （Primary Transaction Commit Schedule）. In the PTCS protocol, a serializable primary transaction schedule is generated firstly and then the secondary trans...This paper proposes a new primary lazy update protocol, PTCS （Primary Transaction Commit Schedule）. In the PTCS protocol, a serializable primary transaction schedule is generated firstly and then the secondary transactions are committed according to the serializable primary transaction schedule. PTCS protocol can guarantee serializability if the data copy graph contains no directed circles. It can also be ex tended to eliminate all requirements on the data copy graph. Compared to earlier works, PTCS protocol not only imposes a much weaker requirement on the data placement, but also avoids the deadlock caused by transaction waits and extra message overhead. The performance experiments show that the degradation of the performance caused by the replica man- agement of the PTCS protocol is tolerable.展开更多
基金Supported by Visiting Scholar Foundation of KeyLabin University and National Lab of Switching Technology and Tele-communication Networks ([2000]123)
文摘This paper proposes a new primary lazy update protocol, PTCS （Primary Transaction Commit Schedule）. In the PTCS protocol, a serializable primary transaction schedule is generated firstly and then the secondary transactions are committed according to the serializable primary transaction schedule. PTCS protocol can guarantee serializability if the data copy graph contains no directed circles. It can also be ex tended to eliminate all requirements on the data copy graph. Compared to earlier works, PTCS protocol not only imposes a much weaker requirement on the data placement, but also avoids the deadlock caused by transaction waits and extra message overhead. The performance experiments show that the degradation of the performance caused by the replica man- agement of the PTCS protocol is tolerable.
