The Complexity of Concurrency Control for Distributed Databases
This study is an analysis of the distributed version of data base concurrency control. It provides concrete mathematical evidence that the distributed problem is an inherently more complex task than the centralized one. The notions of transaction, concurrency, history, serializability, scheduler,...
Main Author: | Kanellakis, Paris C. |
---|---|
Other Authors: | Papadimitriou, Christos H. |
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149547 |
Similar Items
-
On the Computational Complexity of Cardinality Constraints in Relational Databases
by: Kanellakis, Paris C.
Published: (2023) -
A review of concurrency control technique in distributed database
by: Kasim, Shahreen, et al.
Published: (2018) -
Concurrent and Reliable Updates of Distributed Databases
by: Takagi, Akihiro
Published: (2023) -
An Optimality Theory of Concurrency Control for Databases
by: Kung, Hsing-Tsung, et al.
Published: (2023) -
Concurrency control and recovery in database systems /
by: 253037 Bernstein, Philip A., et al.
Published: (1987)