Skip to main content
SpringerLink
Log in

An Efficient Non-intrusive Checkpointing Algorithm for Distributed Database Systems

  • Conference paper
Distributed Computing and Networking (ICDCN 2006)

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

Included in the following conference series:

Abstract

Checkpointing distributed database systems is useful for recovery from failures as well as for audit purposes. In this paper, we present a non-intrusive checkpointing algorithm for distributed database systems. Our approach uses both checkpoints and transaction logs to capture a transaction-consistent state of the database which helps in reducing overall checkpointing overhead. Out approach is non-intrusive and hence does not block arriving or executing transactions during checkpointing.

This material is based in part upon work supported by the US National science Foundation under Grant No. IIS-0414791. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.

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

Access this chapter

Log in via an institution
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. Pilarski, S., Kameda, T.: Checkpointing for distributed databases: Starting from the basics. IEEE Transactions on Parallel and Distributed Systems 3, 602–610 (1992)

    Article  Google Scholar 

  2. Baldoni, R., Quaglia, F., Raynal, M.: Consistent checkpointing for transaction systems. The Computer Journal 44(2) (2001)

    Google Scholar 

  3. Strom, R.E., Yemini, S.A. (eds.): Optimistic Recovery: an Asynchronous Approach to Fault-Tolerance in Distributed Systems (1984)

    Google Scholar 

  4. Vaidya, N.H.: Staggered consistent checkpointing. IEEE Transactions on Parallel and Distributed Systems 10(7), 694–702 (1999)

    Article  MathSciNet  Google Scholar 

  5. Netzer, R.H.B., Xu, J.: Necessary and sufficient condition for consistent global snapshots. IEEE Trans. Soft. Eng. 6, 274–281 (1999)

    Google Scholar 

  6. Wang, Y.M., Fuchs, W.K.: Lazy Checkpoint Coordination for Bounding Rollback Propogation. In: Proc. 12th IEEE Int. Symp. on Reliable Distributed Systems, pp. 78–85. IEEE Computer Society Press, Los Alamitos (1993)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Kentucky, Lexington, KY, 40506, USA

    Jiang Wu & D. Manivannan

Authors
  1. Jiang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Manivannan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Iowa State University, 230 Atanasoff Hall, 50011, Ames, IA, USA

    Soma Chaudhuri

  2. Computer Science Department SUNY at Stony Brook Stony Brook, 11794-4400, NY, USA

    Samir R. Das

  3. Department of Computer Science & Engineering, Indian Institute of Technology, 781039, Guwahati, India

    Himadri S. Paul

  4. Dept. of Electrical and Computer Engineering, Iowa State University, 50010, Ames, IA, USA

    Srikanta Tirthapura

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, J., Manivannan, D. (2006). An Efficient Non-intrusive Checkpointing Algorithm for Distributed Database Systems. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds) Distributed Computing and Networking. ICDCN 2006. Lecture Notes in Computer Science, vol 4308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11947950_9

Download citation

  • DOI: https://doi.org/10.1007/11947950_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68139-7

  • Online ISBN: 978-3-540-68140-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation