The Complexity of Concurrency Control for Distributed Databases
| dc.contributor.advisor | Papadimitriou, Christos H. | en_US |
| dc.contributor.author | Kanellakis, Paris C. | en_US |
| dc.date.accessioned | 2023-03-29T15:05:53Z | |
| dc.date.available | 2023-03-29T15:05:53Z | |
| dc.date.issued | 1981-12 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149547 | |
| dc.description.abstract | 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, etc, for centralized databases are now well-understood both from a theoretical and a practical point of view. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-269 | |
| dc.title | The Complexity of Concurrency Control for Distributed Databases | en_US |
| dc.identifier.oclc | 8700603 |
