Database transaction schedule: Difference between revisions

Revision as of 00:24, 15 March 2024

Revision as of 00:38, 15 March 2024

Line 533:

====Strict====

A schedule is '''strict - has the strictness property -''' if for any two transactions T1, T2, if a write operation of T1 precedes a ''conflicting'' operation of T2 (either read or write), then the commit or abort event of T1 also precedes that conflicting operation of T2.

Any strict schedule is cascade-less, but not the converse. Strictness allows efficient recovery of databases from failure.

Line 549:

==See also==

* [[scheduleSchedule (project management)]]

* [[Two-phase locking|Strong strict two-phase locking]] (SS2PL or Rigorousness).

* [[Snapshot isolation#Making Snapshot Isolation Serializable|Making snapshot isolation serializable]]<ref name="Cahill082"/> in [[Snapshot isolation]].

Line 557:

==References==

{{Reflist}}

*<cite id=Bern1987>[[Phil Bernstein|Philip A. Bernstein]], Vassos Hadzilacos, Nathan Goodman: [http://research.microsoft.com/en-us/people/philbe/ccontrol.aspx ''Concurrency Control and Recovery in Database Systems''], Addison Wesley Publishing Company, 1987, {{ISBN|0-201-10715-5}}</cite>

*<cite id=Weikum2001>[[Gerhard Weikum]], Gottfried Vossen: [http://www.elsevier.com/wps/find/bookdescription.cws_home/677937/description#description ''Transactional Information Systems''], Elsevier, 2001, {{ISBN|1-55860-508-8}}</cite>

[[Category:Data management]]