A multi-version concurrency scheme with no rollbacks

0Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

The multi-version data item concept is a method for increasing concurrency in a database system. All previously proposed schemes utilizing this concept relied on transaction rollback as a means for preserving consistency. These rollbacks require a considerable amount of overhead which degrades performance. In this paper we develop a new scheme that utilizes the multi-version data item concept. Our proposed scheme ensures consistency without the use of rollbacks. It is based upon the non-two phase tree locking protocol previously proposed by Silberschatz and Kedem.

References Powered by Scopus

The Notions of Consistency and Predicate Locks in a Database System

1100Citations
N/AReaders
Get full text

On Optimistic Methods for Concurrency Control

899Citations
N/AReaders
Get full text

System Level Concurrency Control for Distributed Database Systems

227Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Silberschatz, A. (1982). A multi-version concurrency scheme with no rollbacks. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (pp. 216–223). Association for Computing Machinery. https://doi.org/10.1145/800220.806700

Readers over time

‘09‘13‘16‘17‘18‘19‘20‘21‘2301234

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 11

65%

Professor / Associate Prof. 2

12%

Lecturer / Post doc 2

12%

Researcher 2

12%

Readers' Discipline

Tooltip

Computer Science 16

94%

Physics and Astronomy 1

6%

Save time finding and organizing research with Mendeley

Sign up for free
0