An Optimality Theory of Concurrency Control for Databases
A concurrency control mechanism (or a scheduler) is the component of a database system that safeguards the consistency of the database in the presence of interleaved accesses and update requests. We formally show that the performance of a scheduler, i.e. the amount of parallelism that it supports, d...
| Main Authors: | , |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/148996 |
| _version_ | 1811084225137344512 |
|---|---|
| author | Kung, Hsing-Tsung Papadimitrou, Christos H. |
| author_facet | Kung, Hsing-Tsung Papadimitrou, Christos H. |
| author_sort | Kung, Hsing-Tsung |
| collection | MIT |
| description | A concurrency control mechanism (or a scheduler) is the component of a database system that safeguards the consistency of the database in the presence of interleaved accesses and update requests. We formally show that the performance of a scheduler, i.e. the amount of parallelism that it supports, depends explicitly upon the amount of information that is available to the scheduler. We point out that most previous work on concurrency control is simply concerned with specific points of this basic trade-off between performance and information. In fact, several of these approaches are shown to be optimal for the amount of information that they use. |
| first_indexed | 2024-09-23T12:47:16Z |
| id | mit-1721.1/148996 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T12:47:16Z |
| publishDate | 2023 |
| record_format | dspace |
| spelling | mit-1721.1/1489962023-03-30T03:43:19Z An Optimality Theory of Concurrency Control for Databases Kung, Hsing-Tsung Papadimitrou, Christos H. A concurrency control mechanism (or a scheduler) is the component of a database system that safeguards the consistency of the database in the presence of interleaved accesses and update requests. We formally show that the performance of a scheduler, i.e. the amount of parallelism that it supports, depends explicitly upon the amount of information that is available to the scheduler. We point out that most previous work on concurrency control is simply concerned with specific points of this basic trade-off between performance and information. In fact, several of these approaches are shown to be optimal for the amount of information that they use. 2023-03-29T14:17:56Z 2023-03-29T14:17:56Z 1980-11 https://hdl.handle.net/1721.1/148996 7507983 MIT-LCS-TM-185 application/pdf |
| spellingShingle | Kung, Hsing-Tsung Papadimitrou, Christos H. An Optimality Theory of Concurrency Control for Databases |
| title | An Optimality Theory of Concurrency Control for Databases |
| title_full | An Optimality Theory of Concurrency Control for Databases |
| title_fullStr | An Optimality Theory of Concurrency Control for Databases |
| title_full_unstemmed | An Optimality Theory of Concurrency Control for Databases |
| title_short | An Optimality Theory of Concurrency Control for Databases |
| title_sort | optimality theory of concurrency control for databases |
| url | https://hdl.handle.net/1721.1/148996 |
| work_keys_str_mv | AT kunghsingtsung anoptimalitytheoryofconcurrencycontrolfordatabases AT papadimitrouchristosh anoptimalitytheoryofconcurrencycontrolfordatabases AT kunghsingtsung optimalitytheoryofconcurrencycontrolfordatabases AT papadimitrouchristosh optimalitytheoryofconcurrencycontrolfordatabases |