USELESS ACTIONS MAKE A DIFFERENCE: STRICT SERIALIZABILITY OF DATABASE UPDATES.

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

When several transactions read and write items in a database, the question of consistency of the database arises. Consistency is maintained if transactions are serial: the read and write actions of a transaction execute completely before the actions of the next transaction begin. A particular history of interleaved read and write actions belonging to several transactions is correct if it is equivalent to a serial history. Since serializability of histories is known to be NP-complete, subclasses of serializable histories have been studied. One such class consists of histories serializable in a strict sense; transactions that are already in serial in a history must remain in the same relative order. When there are no useless actions in a history, it is shown that strict serializability can be determined in polynomial time. If useless actions are permitted, then strict serializability becomes NP-complete. The results apply to two-step transactions in which there is a read step followed by a write step. Each step involves some subset of the items in the database. With multistep transactions strict serializability is NP-complete even if there are no useless actions.

Original languageEnglish (US)
Pages (from-to)394-403
Number of pages10
JournalJournal of the ACM
Volume29
Issue number2
DOIs
StatePublished - Apr 1982
Externally publishedYes

Fingerprint

Transactions
Update
NP-complete problem
Polynomials
History
Polynomial time
Subset

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Information Systems
  • Software
  • Theoretical Computer Science

Cite this

USELESS ACTIONS MAKE A DIFFERENCE : STRICT SERIALIZABILITY OF DATABASE UPDATES. / Sethi, Ravi.

In: Journal of the ACM, Vol. 29, No. 2, 04.1982, p. 394-403.

Research output: Contribution to journalArticle

@article{bbb21838f1e54e619b3b69199de8efcb,
title = "USELESS ACTIONS MAKE A DIFFERENCE: STRICT SERIALIZABILITY OF DATABASE UPDATES.",
abstract = "When several transactions read and write items in a database, the question of consistency of the database arises. Consistency is maintained if transactions are serial: the read and write actions of a transaction execute completely before the actions of the next transaction begin. A particular history of interleaved read and write actions belonging to several transactions is correct if it is equivalent to a serial history. Since serializability of histories is known to be NP-complete, subclasses of serializable histories have been studied. One such class consists of histories serializable in a strict sense; transactions that are already in serial in a history must remain in the same relative order. When there are no useless actions in a history, it is shown that strict serializability can be determined in polynomial time. If useless actions are permitted, then strict serializability becomes NP-complete. The results apply to two-step transactions in which there is a read step followed by a write step. Each step involves some subset of the items in the database. With multistep transactions strict serializability is NP-complete even if there are no useless actions.",
author = "Ravi Sethi",
year = "1982",
month = "4",
doi = "10.1145/322307.322314",
language = "English (US)",
volume = "29",
pages = "394--403",
journal = "Journal of the ACM",
issn = "0004-5411",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - USELESS ACTIONS MAKE A DIFFERENCE

T2 - STRICT SERIALIZABILITY OF DATABASE UPDATES.

AU - Sethi, Ravi

PY - 1982/4

Y1 - 1982/4

N2 - When several transactions read and write items in a database, the question of consistency of the database arises. Consistency is maintained if transactions are serial: the read and write actions of a transaction execute completely before the actions of the next transaction begin. A particular history of interleaved read and write actions belonging to several transactions is correct if it is equivalent to a serial history. Since serializability of histories is known to be NP-complete, subclasses of serializable histories have been studied. One such class consists of histories serializable in a strict sense; transactions that are already in serial in a history must remain in the same relative order. When there are no useless actions in a history, it is shown that strict serializability can be determined in polynomial time. If useless actions are permitted, then strict serializability becomes NP-complete. The results apply to two-step transactions in which there is a read step followed by a write step. Each step involves some subset of the items in the database. With multistep transactions strict serializability is NP-complete even if there are no useless actions.

AB - When several transactions read and write items in a database, the question of consistency of the database arises. Consistency is maintained if transactions are serial: the read and write actions of a transaction execute completely before the actions of the next transaction begin. A particular history of interleaved read and write actions belonging to several transactions is correct if it is equivalent to a serial history. Since serializability of histories is known to be NP-complete, subclasses of serializable histories have been studied. One such class consists of histories serializable in a strict sense; transactions that are already in serial in a history must remain in the same relative order. When there are no useless actions in a history, it is shown that strict serializability can be determined in polynomial time. If useless actions are permitted, then strict serializability becomes NP-complete. The results apply to two-step transactions in which there is a read step followed by a write step. Each step involves some subset of the items in the database. With multistep transactions strict serializability is NP-complete even if there are no useless actions.

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

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

U2 - 10.1145/322307.322314

DO - 10.1145/322307.322314

M3 - Article

AN - SCOPUS:0020113034

VL - 29

SP - 394

EP - 403

JO - Journal of the ACM

JF - Journal of the ACM

SN - 0004-5411

IS - 2

ER -