Reducing recovery constraints on locking based protocols

G. Alonso, D. Agrawal, A. El Abbadi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Serializability is the standard correctness criterion for concurrency control. To ensure correctness in the presence of failures, recoverability is also imposed. Pragmatic considerations result in further constraints, for instance, the existing log-based recovery implementations that use before-images warrant that transaction executions be strict. Strict executions are restrictive, thus sacrificing concurrency and throughput. In this paper we identify the relation between the recovery mechanism and the restrictions imposed by concurrency control protocols. In particular, we propose a new inverse operation that can be integrated with the underlying recovery mechanisms. In order to establish the viability of our approach, we demonstrate the new implementation by making minor modifications to the conventional recovery architecture. This inverse operation is also designed to avoid the undesirable phenomenon of cascading aborts when transactions execute conflicting write operations.

Original languageEnglish
Title of host publicationProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
Editors Anon
Place of PublicationNew York, NY, United States
PublisherPubl by ACM
Pages129-138
Number of pages10
ISBN (Print)0897916425
Publication statusPublished - 1 Jan 1994
Externally publishedYes
EventProceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - Minneapolis, MN, USA
Duration: 24 May 199426 May 1994

Other

OtherProceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
CityMinneapolis, MN, USA
Period24/5/9426/5/94

Fingerprint

Network protocols
Concurrency control
Recovery
Throughput

ASJC Scopus subject areas

  • Software

Cite this

Alonso, G., Agrawal, D., & El Abbadi, A. (1994). Reducing recovery constraints on locking based protocols. In Anon (Ed.), Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (pp. 129-138). New York, NY, United States: Publ by ACM.

Reducing recovery constraints on locking based protocols. / Alonso, G.; Agrawal, D.; El Abbadi, A.

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ed. / Anon. New York, NY, United States : Publ by ACM, 1994. p. 129-138.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Alonso, G, Agrawal, D & El Abbadi, A 1994, Reducing recovery constraints on locking based protocols. in Anon (ed.), Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. Publ by ACM, New York, NY, United States, pp. 129-138, Proceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Minneapolis, MN, USA, 24/5/94.
Alonso G, Agrawal D, El Abbadi A. Reducing recovery constraints on locking based protocols. In Anon, editor, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. New York, NY, United States: Publ by ACM. 1994. p. 129-138
Alonso, G. ; Agrawal, D. ; El Abbadi, A. / Reducing recovery constraints on locking based protocols. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. editor / Anon. New York, NY, United States : Publ by ACM, 1994. pp. 129-138
@inproceedings{63d5b6dd74e34bab8ea45ec495851fd8,
title = "Reducing recovery constraints on locking based protocols",
abstract = "Serializability is the standard correctness criterion for concurrency control. To ensure correctness in the presence of failures, recoverability is also imposed. Pragmatic considerations result in further constraints, for instance, the existing log-based recovery implementations that use before-images warrant that transaction executions be strict. Strict executions are restrictive, thus sacrificing concurrency and throughput. In this paper we identify the relation between the recovery mechanism and the restrictions imposed by concurrency control protocols. In particular, we propose a new inverse operation that can be integrated with the underlying recovery mechanisms. In order to establish the viability of our approach, we demonstrate the new implementation by making minor modifications to the conventional recovery architecture. This inverse operation is also designed to avoid the undesirable phenomenon of cascading aborts when transactions execute conflicting write operations.",
author = "G. Alonso and D. Agrawal and {El Abbadi}, A.",
year = "1994",
month = "1",
day = "1",
language = "English",
isbn = "0897916425",
pages = "129--138",
editor = "Anon",
booktitle = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Reducing recovery constraints on locking based protocols

AU - Alonso, G.

AU - Agrawal, D.

AU - El Abbadi, A.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - Serializability is the standard correctness criterion for concurrency control. To ensure correctness in the presence of failures, recoverability is also imposed. Pragmatic considerations result in further constraints, for instance, the existing log-based recovery implementations that use before-images warrant that transaction executions be strict. Strict executions are restrictive, thus sacrificing concurrency and throughput. In this paper we identify the relation between the recovery mechanism and the restrictions imposed by concurrency control protocols. In particular, we propose a new inverse operation that can be integrated with the underlying recovery mechanisms. In order to establish the viability of our approach, we demonstrate the new implementation by making minor modifications to the conventional recovery architecture. This inverse operation is also designed to avoid the undesirable phenomenon of cascading aborts when transactions execute conflicting write operations.

AB - Serializability is the standard correctness criterion for concurrency control. To ensure correctness in the presence of failures, recoverability is also imposed. Pragmatic considerations result in further constraints, for instance, the existing log-based recovery implementations that use before-images warrant that transaction executions be strict. Strict executions are restrictive, thus sacrificing concurrency and throughput. In this paper we identify the relation between the recovery mechanism and the restrictions imposed by concurrency control protocols. In particular, we propose a new inverse operation that can be integrated with the underlying recovery mechanisms. In order to establish the viability of our approach, we demonstrate the new implementation by making minor modifications to the conventional recovery architecture. This inverse operation is also designed to avoid the undesirable phenomenon of cascading aborts when transactions execute conflicting write operations.

UR - http://www.scopus.com/inward/record.url?scp=0028022226&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028022226&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0028022226

SN - 0897916425

SP - 129

EP - 138

BT - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

A2 - Anon, null

PB - Publ by ACM

CY - New York, NY, United States

ER -