Skip to main content
SpringerLink
Log in

An optimistic resiliency control scheme for distributed database systems

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1987)

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

Included in the following conference series:

  • 145 Accesses

Abstract

Site failures and network partitioning affect transaction processing in distributed database systems. A system is resilient to certain failures if transaction processing can continue even in the presence of those failures. A resiliency control scheme takes care of the activities related to resiliency, namely, resolving transactions that are being processed when failures occur, enabling processing of new transactions in the presence of failures, and brining the sites that were inaccessible at the time of failures up-to-date when failures are rectified.

In this paper, we describe a resiliency control scheme, for a fully replicated distributed database system, that is optimistic with respect to system failures. That is, normal transaction processing is done assuming that no failures will occur. If failures are suppected at some stage, then a system reconfiguration is undertaken. The reconfiguration and continued system operation are guaranteed as long as there exists a majority of working sites belonging to the same partition.

Our scheme is suitable when subsystem failures occur ramely, and for autonomous distributed and multidatabase systems where sites may communicate with each other at their will.

This work was supported in part by the Natural Sciences and Engineering Research Council of Canada under Grant No. A-3182 and in part by the National Science Foundation of the United States under Grant No. ECS-8307478.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Breitwieser and M. Leszak, “Improving Availability of Partially Redundant Databases by Majority Consensus Protocols”, in Distributed Databases, ed. H.-J. Schneider, Amsterdam: North-Holland, 1982.

    Google Scholar 

  2. K.P. Eswaran, J.N. Gray, R.A. Lorie, and I.L. Traiger, “The Notions of Consistency and Predicate Locks in a Database System”, Communications of ACM, 19:11 (1976), 624–33.

    Article  Google Scholar 

  3. F. Eliassen and J. Veijalainen, “Language Support for Multidatabase Transactions in a Cooperative, Autonomous Environment”, TENCON'87, IEEE Regional Conference, Seoul, 1987.

    Google Scholar 

  4. H. Garcia-Molina, Performance of Updata Algorithms for Replicated Data, UMI Research Press, 1981.

    Google Scholar 

  5. J. Gray, “An Approach to Decentralized Computer Systems”, IEEE Trans. on Software Engineering SE-12:6 (June 1986), 684–692.

    Google Scholar 

  6. V. Gligor and R. Popescu-Zeletin, “Transaction Management in Distributed Heterogeneous Database Management Systems”, Information Systems, 11:4(1986), 287–297.

    Article  Google Scholar 

  7. D. Heimbignor and D. McLeod, “A Federated Architecture for Information Management”, ACM Trans. on Office Information Systems, 3:3(July 1985), 253–278.

    Article  Google Scholar 

  8. W. Litwin, “An Overview of the Multidatabase System MRDSM”, Proc. ACM National Conference, 1985, 524–533.

    Google Scholar 

  9. T. Minoura, S. Owicki, and G. Wiederhold, “Consistent Distributed Database State Maintenance”, Technical Report 83-60-2, Department of Computer Science, Oregon State University, Corvallis.

    Google Scholar 

  10. T. Minoura and K. Vidyasankar, “Capability-Based Resiliency Control of Distributed Database Systems”, Technical Report 84-60-7, Department of Computer Science, Oregon State University, Corvallis.

    Google Scholar 

  11. T. Minoura and G. Wiederhold, “Resilient Extended True-Copy Token Scheme for a Distributed Database System”, IEEE Trans. on Software Engineering SE-8: 3 (May 1982), 173–189.

    Google Scholar 

  12. C.H. Papadimitriou, “The Serializability of Concurrent Database Updates”, Journal of ACM, 26:4 (1979), 631–53.

    Article  Google Scholar 

  13. R.H. Thomas, “A Majority Consensus Approach to Concurrency Control”, ACM Trans. on Database Systems, 4:2(1979),180–209.

    Article  Google Scholar 

  14. K. Vidyasankar, “A Model for Majority Resiliency Control Schemes”, INFOR 23:3(1985), 330–343.

    Google Scholar 

  15. K. Vidyasankar, “Generalized Theory of Serializability”, Acta Informatica, 24:1(1987), 105–119.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Memorial University of Newfoundland, A1C 5S7, St. John's, Nfld., Canada

    K. Vidyasankar

  2. Department of Computer Science, Oregon State University, 97331-4602, Corvallis, Oregon, USA

    Toshimi Minoura

Authors
  1. K. Vidyasankar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toshimi Minoura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vidyasankar, K., Minoura, T. (1988). An optimistic resiliency control scheme for distributed database systems. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019810

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19366-1

  • Online ISBN: 978-3-540-39239-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation