Achieving robustness in distributed database systems

Derek L. Eager, Kenneth C. Sevcik

ACM Transactions on Database Systems · 1983 · 123 citations · 19 references

DOIFull text

Open access

Concepts

TL;DR

Concurrency control in distributed databases must handle arbitrary failures, including site and link outages that can cause network partitioning. The goal is to achieve high robustness so that failures minimally affect system operation. The authors present a basis for implementing maximal partial operability and demonstrate its application to distributed locking and timestamp-based concurrency control. They identify maximal partial operability as the highest attainable robustness level that does not significantly degrade performance, and show that it adds negligible overhead when no failures occur.

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.

References

19