Relative serializability

an approach for relaxing the atomicity of transactions

D. Agrawal, J. L. Bruno, A. El Abbadi, V. Krishnaswamy

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

21 Citations (Scopus)

Abstract

In the presence of semantic information, serializability is too strong a correctness criterion and unnecessarily restricts concurrency. We use the semantic information of a transaction to provide different atomicity views of the transaction to other transactions. The proposed approach improves concurrency and allows interleavings among transactions which are non-serializable, but which nonetheless preserve the consistency of the database and are acceptable to the users. We develop a graph-based tool whose acyclicity is both a necessary and sufficient condition for the correctness of an execution. Our theory encompasses earlier proposals that incorporate semantic information of transactions. Furthermore it is the first approach that provides an efficient graph based tool for recognizing correct schedules without imposing any restrictions on the applications domain.

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
Pages139-149
Number of pages11
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

Semantics

ASJC Scopus subject areas

  • Software

Cite this

Agrawal, D., Bruno, J. L., El Abbadi, A., & Krishnaswamy, V. (1994). Relative serializability: an approach for relaxing the atomicity of transactions. In Anon (Ed.), Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (pp. 139-149). New York, NY, United States: Publ by ACM.

Relative serializability : an approach for relaxing the atomicity of transactions. / Agrawal, D.; Bruno, J. L.; El Abbadi, A.; Krishnaswamy, V.

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. 139-149.

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

Agrawal, D, Bruno, JL, El Abbadi, A & Krishnaswamy, V 1994, Relative serializability: an approach for relaxing the atomicity of transactions. 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. 139-149, Proceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Minneapolis, MN, USA, 24/5/94.
Agrawal D, Bruno JL, El Abbadi A, Krishnaswamy V. Relative serializability: an approach for relaxing the atomicity of transactions. 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. 139-149
Agrawal, D. ; Bruno, J. L. ; El Abbadi, A. ; Krishnaswamy, V. / Relative serializability : an approach for relaxing the atomicity of transactions. 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. 139-149
@inproceedings{f57bc05d2c824841b67a5f6cc9949b58,
title = "Relative serializability: an approach for relaxing the atomicity of transactions",
abstract = "In the presence of semantic information, serializability is too strong a correctness criterion and unnecessarily restricts concurrency. We use the semantic information of a transaction to provide different atomicity views of the transaction to other transactions. The proposed approach improves concurrency and allows interleavings among transactions which are non-serializable, but which nonetheless preserve the consistency of the database and are acceptable to the users. We develop a graph-based tool whose acyclicity is both a necessary and sufficient condition for the correctness of an execution. Our theory encompasses earlier proposals that incorporate semantic information of transactions. Furthermore it is the first approach that provides an efficient graph based tool for recognizing correct schedules without imposing any restrictions on the applications domain.",
author = "D. Agrawal and Bruno, {J. L.} and {El Abbadi}, A. and V. Krishnaswamy",
year = "1994",
month = "1",
day = "1",
language = "English",
isbn = "0897916425",
pages = "139--149",
editor = "Anon",
booktitle = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Relative serializability

T2 - an approach for relaxing the atomicity of transactions

AU - Agrawal, D.

AU - Bruno, J. L.

AU - El Abbadi, A.

AU - Krishnaswamy, V.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - In the presence of semantic information, serializability is too strong a correctness criterion and unnecessarily restricts concurrency. We use the semantic information of a transaction to provide different atomicity views of the transaction to other transactions. The proposed approach improves concurrency and allows interleavings among transactions which are non-serializable, but which nonetheless preserve the consistency of the database and are acceptable to the users. We develop a graph-based tool whose acyclicity is both a necessary and sufficient condition for the correctness of an execution. Our theory encompasses earlier proposals that incorporate semantic information of transactions. Furthermore it is the first approach that provides an efficient graph based tool for recognizing correct schedules without imposing any restrictions on the applications domain.

AB - In the presence of semantic information, serializability is too strong a correctness criterion and unnecessarily restricts concurrency. We use the semantic information of a transaction to provide different atomicity views of the transaction to other transactions. The proposed approach improves concurrency and allows interleavings among transactions which are non-serializable, but which nonetheless preserve the consistency of the database and are acceptable to the users. We develop a graph-based tool whose acyclicity is both a necessary and sufficient condition for the correctness of an execution. Our theory encompasses earlier proposals that incorporate semantic information of transactions. Furthermore it is the first approach that provides an efficient graph based tool for recognizing correct schedules without imposing any restrictions on the applications domain.

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

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

M3 - Conference contribution

SN - 0897916425

SP - 139

EP - 149

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 -