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: | |
|---|---|
| Other Authors: | |
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149547 |
| _version_ | 1811082134957326336 |
|---|---|
| author | Kanellakis, Paris C. |
| author2 | Papadimitriou, Christos H. |
| author_facet | Papadimitriou, Christos H. Kanellakis, Paris C. |
| author_sort | Kanellakis, Paris C. |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T11:58:07Z |
| id | mit-1721.1/149547 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T11:58:07Z |
| publishDate | 2023 |
| record_format | dspace |
| spelling | mit-1721.1/1495472023-03-30T03:47:57Z The Complexity of Concurrency Control for Distributed Databases Kanellakis, Paris C. Papadimitriou, Christos H. 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. 2023-03-29T15:05:53Z 2023-03-29T15:05:53Z 1981-12 https://hdl.handle.net/1721.1/149547 8700603 MIT-LCS-TR-269 application/pdf |
| spellingShingle | Kanellakis, Paris C. The Complexity of Concurrency Control for Distributed Databases |
| title | The Complexity of Concurrency Control for Distributed Databases |
| title_full | The Complexity of Concurrency Control for Distributed Databases |
| title_fullStr | The Complexity of Concurrency Control for Distributed Databases |
| title_full_unstemmed | The Complexity of Concurrency Control for Distributed Databases |
| title_short | The Complexity of Concurrency Control for Distributed Databases |
| title_sort | complexity of concurrency control for distributed databases |
| url | https://hdl.handle.net/1721.1/149547 |
| work_keys_str_mv | AT kanellakisparisc thecomplexityofconcurrencycontrolfordistributeddatabases AT kanellakisparisc complexityofconcurrencycontrolfordistributeddatabases |