Transactions and consistency in distributed database systems
- 1 September 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 7 (3) , 323-342
- https://doi.org/10.1145/319732.319734
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.Keywords
This publication has 7 references indexed in Scilit:
- Concurrency control in a system for distributed databases (SDD-1)ACM Transactions on Database Systems, 1980
- Concurrency Control and Consistency of Multiple Copies of Data in Distributed IngresIEEE Transactions on Software Engineering, 1979
- Weighted voting for replicated dataPublished by Association for Computing Machinery (ACM) ,1979
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- System level concurrency control for distributed database systemsACM Transactions on Database Systems, 1978
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- Concurrency control for database systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976