Skip to main content
SpringerLink
Log in

Efficient management of replicated data

  • Miscellaneous Topics
  • Conference paper
  • First Online:
ICDT '88 (ICDT 1988)

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

Included in the following conference series:

Abstract

We propose in this paper a protocol aimed at managing replicated data with many copies more efficiently. Our protocol, called Majority Consensus Voting with Tokens generalizes the primary copy approach by allowing for more than one primary copy. Since primary copies are identified by the ownership of a token, the protocol allows for easy transfer of tokens from one copy to another to respond to changing access patterns. Tokens owned by failed primary copies can also be reassigned to some live copy to enhance data availability.

Upper and lower bounds for the availability of replicated data objects managed by the MCVT protocol are derived under very general probabilistic hypotheses. We show that MCVT significantly improves upon the availability and reliability offered by the primary copy protocol without incurring the high overhead of most other extant protocols.

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. D. Barbara, H. Garcia-Molina and A. Spauster, “Policies for Dynamic Vote Reassignment,” Proc. Sixth International Conference on Distributed Computing Systems (1986), pp. 37–44.

    Google Scholar 

  2. Barslow, R. E. and K. D. Heidtmann, Computing k-out-of-n System Reliability. IEEE Trans. on Reliability, R-33, 4 (Oct. 1984), 322–323.

    Google Scholar 

  3. P. A. Bernstein and N. Goodman, “An Algorithm for Concurrency Control and Recovery in Replicated Distributed Databases,” ACM Trans. on Database Systems, Vol. 9, No. 4 (Dec. 1984), 596–615.

    Google Scholar 

  4. J. L. Carroll, D. D. E. Long and J.-F. Pâris, “Block-Level Consistency of Replicated Files.” Proc. Seventh International Conference on Distributed Computing Systems (Sept. 1987), pp. 146–153.

    Google Scholar 

  5. D. Davcev and W.A. Burkhard, “Consistency and Recovery Control for Replicated Files,” Proc. Tenth ACM Symposium on Operating System Principles, (1985), pp. 87–96.

    Google Scholar 

  6. C. A. Ellis, “Consistency and Correctness of Duplicate Database Systems,” Operating Systems Review, 11, 1977.

    Google Scholar 

  7. D. K. Gifford, “Weighted Voting for Replicated Data,” Proc. Seventh ACM Symposium on Operating System Principles, (1979), pp. 150–161.

    Google Scholar 

  8. N. Goodman, D. Skeen, A. Chan, U. Dayal, R. Fox and D. Ries, “A Recovery Algorithm for a Distributed Database System,” Proc. Second ACM Symposium on Principles of Database Systems, (1983), pp. 8–15.

    Google Scholar 

  9. S. Jajodia, “Managing Replicated Files in Partitioned Distributed Database Systems,” Proc. Third International Conference on Data Engineering, (Feb. 1987).

    Google Scholar 

  10. D.D.E. Long and J.-F. Pâris, “On Improving the Availability of Replicated Files,” Proc. Sixth Symposium on Reliability in Distributed Systems and Database Systems, (1987), pp. 77–83.

    Google Scholar 

  11. D. D. E. Long and J.-F. Pâris, “Regeneration Protocols for Replicated Files,” submitted for publication.

    Google Scholar 

  12. J. D. Noe and A. Andreassian, “Effectiveness of Replication in Distributed Computing Networks,” Proc. Seventh International Conference on Distributed Computing Systems, (1987), pp. 508–513.

    Google Scholar 

  13. J.-F. Pâris and D. D. E. Long, “Efficient Dynamic Voting Algorithms,” Proc. Fourth International Conference on Data Engineering, Los Angeles, Calif. (February 1988), pp. 268–275.

    Google Scholar 

  14. J.-F. Pâris, “Operational Analysis of Redundant Systems,” Proc. International Workshop on Modelling Techniques and Performance Evaluation (March 1987), pp. 41–48.

    Google Scholar 

  15. C. Pu, J. D. Noe and A. Proudfoot, “Regeneration of Replicated Objects: A Technique and its Eden Implementation,” Proc. Second International Conference on Data Engineering, Los Angeles, Calif. (February 1986), pp. 175–187.

    Google Scholar 

  16. M. Stonebraker, “Concurrency Control and Consistency of Multiple Copies of Data in Distributed INGRES,” IEEE Transactions on Software Engineering, SE-5, 3 (May 1979), 188–194.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Systems Research Group Department of Computer Science and Engineering, University of California, 92093, San Diego La Jolla, CA

    Jehan-Francois Pâris

Authors
  1. Jehan-Francois Pâris
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marc Gyssens Jan Paredaens Dirk Van Gucht

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pâris, JF. (1988). Efficient management of replicated data. In: Gyssens, M., Paredaens, J., Van Gucht, D. (eds) ICDT '88. ICDT 1988. Lecture Notes in Computer Science, vol 326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50171-1_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-50171-1_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50171-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation