Distributed databases principles and systems
Distributed databases principles and systems
The theory of database concurrency control
The theory of database concurrency control
Correctness conditions for highly available replicated databases
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Highly available distributed services and fault-tolerant distributed garbage collection
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Limitations on database availability when networks partition
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Optimistic concurrency control for abstract data types
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
An introduction to distributed and parallel computing
An introduction to distributed and parallel computing
Using histories to implement atomic objects
ACM Transactions on Computer Systems (TOCS)
Using semantic knowledge for transaction processing in a distributed database
ACM Transactions on Database Systems (TODS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Introduction to a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
| Hi-index | 0.00 |
In a distributed system some or all of the data items are replicated and stored at separate nodes. This increases the availability of these items and it is then possible to complete transactions faster than in single node systems. Hovever the concurrent processing of transactions at separate nodes can generate inconsistencies in the stored information. Some mechanism must be employed to address the inconsistencies that can arise. A system has been designed that allows a transaction to be processed immediately (optimistically) at any individual node in a replicated system as long as the transaction satisfies a cost bound criterion. Such a transaction can make external responses but it does not alter the database. All transactions are also run in a global one-copy serializable manner (pessimistically) at which time their updates are committed. It may be necessary to make another external response. The transaction processing system is expressed as a simple computational model and the correctness of the system is discussed.