Achieving robustness in distributed database systems

83Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

Abstract

The problem of concurrency control in distributed database systems in which site and communication link failures may occur is considered. The possible range of failures is not restricted; in particular, failures may induce an arbitrary network partitioning. It is desirable to attain a high “level of robustness” in such a system; that is, these failures should have only a small impact on system operation.A level of robustness termed maximal partial operability is identified. Under our models of concurrency control and robustness, this robustness level is the highest level attainable without significantly degrading performance.A basis for the implementation of maximal partial operability is presented. To illustrate its use, it is applied to a distributed locking concurrency control method and to a method that utilizes timestamps. When no failures are present, the robustness modifications for these methods induce no significant additional overhead. © 1983, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Eager, D. L., & Sevcik, K. C. (1983). Achieving robustness in distributed database systems. ACM Transactions on Database Systems (TODS), 8(3), 354–381. https://doi.org/10.1145/319989.319992

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free