Precedence graph
id:
precedence-graph-249-9028023
title:
Precedence graph
text:
A precedence graph, also named conflict graph and serializability graph, is used in the context of concurrency control in databases. It is the directed graph representing precedence of transactions in the schedule, as reflected by precedence of conflicting operations in the transactions. A schedule is conflict-serializable if and only if its precedence graph of committed transactions is acyclic. The precedence graph for a schedule S contains: A node for each committed transaction in S
An arc fro
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Precedence_graph
date created:
date modified:
2023-12-27T19:00:35Z
main entity:
{"identifier":"Q17141564","url":"https://www.wikidata.org/entity/Q17141564"}
image:
fields total:
13
integrity:
13