Transactions and Consistency in Distributed Database Systems

71Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

Abstract

The concepts of transaction and of data consistency are defined for a distributed system. The cases of partitioned data, where fragments of a file are stored at multiple nodes, and replicated data, where a file is replicated at several nodes, are discussed. It is argued that the distribution and replication of data should be transparent to the programs which use the data. That is, the programming interface should provide location transparency, replica transparency, concurrency transparency, and failure transparency. Techniques for providing such transparencies are abstracted and discussed.By extending the notions of system schedule and system clock to handle multiple nodes, it is shown that a distributed system can be modeled as a single sequential execution sequence. This model is then used to discuss simple techniques for implementing the various forms of transparency. © 1982, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Traiger, I. L., Gray, J., Galtieri, C. A., & Lindsay, B. G. (1982). Transactions and Consistency in Distributed Database Systems. ACM Transactions on Database Systems (TODS), 7(3), 323–342. https://doi.org/10.1145/319732.319734

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