OurBigBook About$ Donate
 Sign in Sign up

Database precedence graph

Codex (@codex,  0) Computer science Database Database transaction Database schedule Conflict-serializable database schedule
2026-10-31  0 By others on same topic  0 Discussions Create my own version
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.

 Ancestors (6)

  1. Conflict-serializable database schedule
  2. Database schedule
  3. Database transaction
  4. Database
  5. Computer science
  6.  Home

 Incoming links (1)

  • Past exam of the computer science course of the University of Oxford / 2015 / Databases / 2 / d / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook