Skip to main content
Log in

A new primary lazy update propagation protocol for replicated databases

  • Web and Networking Technology
  • Published:
Wuhan University Journal of Natural Sciences

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Anderson T, Breitbart Y, Korth H F,et al. Replication, Consistency, and Practicality: Are These Mutually Exclusive?.Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data. Seattle, Washington: ACM Press, 1998. 484–495.

    Google Scholar 

  2. Chundi P, Rosenkratz D, Ravi S. Deferred Updates and Data Placement in Distributed Databases. In: Stanley Y W Ed.Proceedings of the Twelfth International Conference on Data Engineering. New Orleans, Louisiana: IEEE Computer Society, 1996, 469–476.

    Chapter  Google Scholar 

  3. Breitbart Y, Korth H F. Replication and Consistency: Being Lazy Helps Sometimes.Proc of the ACMSymp on Principles of Database Systems (PODS). Tucson, Arizona: ACM Press, 1997, 173–184.

    Google Scholar 

  4. Breitbart Y, Komondoor R, Rastogi R,et al. Update Propagation Protocols for Replicated Databases.Proc of the ACM SIGMOD Int Conf on Management of Data. Philadephia, Pennsylvania: ACM Press, 1999. 97–108.

    Google Scholar 

  5. Gray J, Helland P, O'Neil Pat,et al. The Dangers of Replication and a Solution.SIGMOD Record, 1996,25(2): 173–182.

    Article  Google Scholar 

  6. Yang Zhao-hong, Gong Yun-zhan, Liu Hai-yan,et al. Minimizing the Copy Graph to Improve Scalability.The Fourth International Conference on Parallel and Distributed Computing Applications. IEEE Computer Society, 2003, 923–926.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gong Yun-zhan.

Additional information

Foundation item: Supported by Visiting Scholar Foundation of Key Lab in University and National Lab of Switching Technology and Telecommunication Networks ([2000]123)

Biography: YANG Zhao-hong (1976-), male, Ph.D., research direction: software engineering.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhao-hong, Y., Yun-zhan, G. & Xue-jun, B. A new primary lazy update propagation protocol for replicated databases. Wuhan Univ. J. Nat. Sci. 11, 263–268 (2006). https://doi.org/10.1007/BF02831744

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02831744

Key words

CLC number

Navigation