Multi-version concurrency control scheme for a database system

作者:

Highlights:

摘要

A concurrency control scheme using multiple versions of data objects is presented which allows increased concurrency. The scheme grants an appropriate version to each read request. Transactions issuing write requests which might destroy database integrity are aborted. It is precisely stated when old versions can be discarded and how to eliminate the effects of aborted transactions is described in detail. The scheduler outputs only (multi-version) ww-serializable histories which preserve database consistency. It is shown that any “D-serializable” history of Papadimitriou (J. Assoc. Comput. Mach. 26 (4) (1979), 631–653) (or “conflict-preserving serializable log” of Bernstein et al., IEEE Trans. Software Engrg. SE-5 (3) (1979), 203–216) is ww-serializable.

论文关键词:

论文评审过程:Received 13 April 1982, Revised 10 July 1983, Available online 2 December 2003.

论文官网地址:https://doi.org/10.1016/0022-0000(84)90031-X