An ordering of operations of several database transactions that preserves the operation order within each database transaction.
A database schedule that can be turned into a serial database schedule by swapping adjacent operations of different database transactions that do not conflict. Reads and writes of the same object conflict when at least one is a write.
A directed graph with a vertex for each database transaction and an edge from the earlier to the later participant in each conflicting pair of operations. A database schedule is a conflict-serializable database schedule exactly when this directed graph has no directed cycle.
A database schedule in which every database transaction runs as one contiguous group, without interleaving another database transaction.
Articles by others on the same topic
There are currently no matching articles.