Skip to main content

Tree-Based Dynamic Primary Copy Algorithms for Replicated Databases

  • Conference paper
Distributed Computing and Networking (ICDCN 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5408))

Included in the following conference series:

  • 768 Accesses

Abstract

With increasing demand for performance, availability and fault tolerance in databases, data replication is gaining more and more importance. Resolving or serializing conflicting update requests is the main challenge in large scale deployment of replicated databases. In this paper, we propose the first token based dynamic primary copy algorithms for resolving conflicting requests among different sites of replicated databases. The contribution being reduction in the number of messages required per update request.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Sun, C., Lin, Y., Kemme, B.: Comparison of UDDI Registry Replication Strategies. In: ICWS 2004, pp. 218–225 (2004)

    Google Scholar 

  2. Wolski, A.: Applying Replication to Data recharging in Mobile Systems. Solid Information Technology 7(2) (2001)

    Google Scholar 

  3. Breitbart, Y., Komondoor, R., Rastogi, R., Seshadri, S.: Update Protocols for Replicated Database. In: ICDE, pp. 469–476 (1996)

    Google Scholar 

  4. Anderson, T.A., Breibart, Y., Korth, H.F., Wool, A.: Replication, Consistancy and Pratcality: Are these Mutually Exclusive? In: ACM SIGMOD 1998, pp. 485–495 (1998)

    Google Scholar 

  5. Ananthanarayana, V.S., Vidyasankar, K.: Dynamic Primary Copy with Piggy-Backing Mechanism for Replicated UDDI Registry. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds.) ICDCIT 2006. LNCS, vol. 4317, pp. 389–402. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Bharath Kumar, A.R., Pradhan, B.U., Ananthanarayana, V.S.: An Efficient Lazy Dynamic Primary Copy Algorithm for Replicated UDDI Registry. In: ICIP 2008, pp. 564–571 (2008)

    Google Scholar 

  7. Pradhan, B.U., Bharath Kumar, A.R., Ananthanarayana, V.S.: An Efficient Eager Dynamic Primary Copy Algorithm for Replicated UDDI Registry. In: ICCNS 2008, pp. 161–166 (2008)

    Google Scholar 

  8. Raymond, K.: A tree-based algorithm for distributed Mutual Exclusion. ACM Transactions on Computer Systems 7(1), 61–77 (1989)

    Article  Google Scholar 

  9. Lamport, L.: Time, Clocks and the ordering of Events in a Distributed System. Communications of the ACM, 558–565 (1978)

    Google Scholar 

  10. Huang, Y., Wolfson, O.: A Competitive Dynamic Data Replication Algorithm. In: Proceedings of the Ninth International Conference on Data Engineering, April 1993, pp. 310–317 (1993)

    Google Scholar 

  11. Revannaswamy, V., Bhatt, P.C.P.: A Fault Tolerant Protocol as an Extension to a Distributed Mutual Exclusion Algorithm. In: ICPADS 1997, p. 730 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Umesh, P.B., Bharath Kumar, A.R., Ananthanarayana, V.S. (2008). Tree-Based Dynamic Primary Copy Algorithms for Replicated Databases. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds) Distributed Computing and Networking. ICDCN 2009. Lecture Notes in Computer Science, vol 5408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92295-7_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92295-7_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92294-0

  • Online ISBN: 978-3-540-92295-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics