数据库优先图_优先图| 数据库管理系统

数据库优先图

优先图 (Precedence graph)

A precedence graph, also known as serialization graph or conflict graph, is used for testing Conflict Serializability of a schedule in the condition that forms the setting of concurrency control in databases.

优先级图 (也称为序列化图或冲突图 )用于在形成数据库中并发控制设置的条件下测试计划的冲突可序列化性。

It is also known as a directed Graph G = (V, E), which consists of a pair of a set of nodes V = {V1, V2, V3, ..., Vn} and a set of directed edges E = {E1, E2, E3, ..., Em}. Where the set of nodes V are testing to retrieve identical data attribute through the transactions of a schedule and the set of edges E is regulated connectivity between a set of two nodes.

也称为有向图G =(V，E) ，它由一对节点集合V = {V1，V2，V3，...，Vn}和一组有向边E = { E1，E2，E3，...，Em} 。 其中，节点集V正在通过调度的事务进行测试以检索相同的数据属性，而边缘E的集是两个节点集之间受监管的连接性。

Nodes: In the graph, for each transaction Tp the graph contains a single node. So, In a schedule of a precedence graph, The total number of transactions will be similar to the total number of nodes.

节点：在图中，对于每个事务Tp ，图中都包含一个节点。 因此，在优先级图的调度中，事务的总数将类似于节点的总数。

Edges: An edge is regulated connectivity between a set of two distinct transactions Tq and Tr and it shows in the for