Content deleted Content added
→top: improved it by reducing redundancy and making it more clear and concise Tags: Mobile edit Mobile app edit Android app edit |
m →top Tags: Mobile edit Mobile app edit Android app edit |
||
Line 5:
In the fields of [[database]]s and [[transaction processing]] (transaction management), a '''schedule''' (or '''history''') of a system is an abstract model to describe the order of [[Execution (computing)|executions]] in a set of transactions running in the system. Often it is a ''list'' of operations (actions) ordered by time, performed by a set of [[Database transaction|transactions]] that are executed together in the system. If the order in time between certain operations is not determined by the system, then a ''[[partial order]]'' is used. Examples of such operations are requesting a read operation, reading, writing, aborting, [[Commit (data management)|committing]], requesting a [[Lock (computer science)|lock]], locking, etc. Often, only a subset of the transaction operation types are included in a schedule.
Schedules are fundamental concepts in database [[concurrency control]] theory. In practice, most general purpose database systems employ conflict-serializable and strict recoverable
==Notation==
| |||