| A New Primary Lazy Update Propagation Protocol for Replicated Databases |
| |
| 作者姓名： | YANG Zhao-hong GONG Yun-zhan BI Xue-jun |
| |
| 作者单位： | Departmenl of Information Engineering, The Academy of Armored Force Engineering, Beijing 100072, China |
| |
| 基金项目： | Supported by Visiting Scholar Foundation of Key Lab in University and National Lab of Switching Technology and Telecommunication 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.
|
| 关 键 词： | 数据库 数据复制 整体可串行性 更新传播协议 |
| 文章编号： | 1007-1202（2006）01-0263-06 |
| 收稿时间： | 2005-05-10 |
A new primary lazy update propagation protocol for replicated databases |
| |
| YANG Zhao-hong GONG Yun-zhan BI Xue-jun.A New Primary Lazy Update Propagation Protocol for Replicated Databases[J].Wuhan University Journal of Natural Sciences,2006,11(1):263-268. |
| |
| Authors: | Yang Zhao-hong Gong Yun-zhan Bi Xue-jun |
| |
| Institution: | (1) Department of Information Engineering, The Academy of Armored Force Engineering, 100072 Beijing, China |
| |
| Abstract: | 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 extended 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 management of the PTCS protocol is tolerable. |
| |
| Keywords: | data replication global serializability data copy graph |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
