Skip to main content

An Update Propagation Method Based on the Tree of Replicas in Partially Replicated Databases

  • Conference paper
Parallel and Distributed Computing: Applications and Technologies (PDCAT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3320))

Abstract

In the single master lazy updates propagation methods that guarantee weakly consistency, they may increase the read availability, but have more chances for update conflicts. We propose an effective update propagation method to resolve this non-serializable execution. The proposed method is based on the balanced tree of replicas in the partially replicated databases and uses the timestamp and the information of the RCTL(the most Recent Committed update-Transaction List) in the status database. We made an experiment of our algorithm through the simulation, and proved that it has good performance due to reducing the abort ratio and response time of transactions.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jim, G., Pat, H., Patrick, O., Dennis, S.: The Danger of Replication and a Solution. In: Procs. of ACM SIGMOD International Conf. on Management of Data, Montreal Canada, pp. 173–182 (1996)

    Google Scholar 

  2. Todd, A., Yuri, B., Henry, F.K., Avishai, W.: Replication, consistency and practicality: Are these mutually exclusive? In: Procs. of the ACM SIGMOD International Conf. on Management of Data, Seattle WA, pp. 484–495 (1998)

    Google Scholar 

  3. Xiangning, L., Abdelsalam, H., Weimin, D.: Multiview Access Protocols for Large Scale Replication. ACM Transaction on Database Systems 23(2), 158–198 (1998)

    Article  Google Scholar 

  4. Yuri, B., Henry, F.K.: Replication and Consistency: Being lazy helps sometimes. In: Procs. of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Tucson Arizona, pp. 173–184 (1997)

    Google Scholar 

  5. Esther, P., Eric, S.: Update Propagation Strategies to Improve Freshness in Lazy Master Replicated Databases. VLDB Journal, 305–318 (2000)

    Google Scholar 

  6. Marta, P.M., Ricardo, J.P., Kemme, B., Alonso, G.: Scalable Replication in Database Clusters. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 315–329. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bae, M., Hwang, B. (2004). An Update Propagation Method Based on the Tree of Replicas in Partially Replicated Databases. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30501-9_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24013-6

  • Online ISBN: 978-3-540-30501-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics