数据库并发控制

Conflict Serializable Schedules • Two schedules are conflict equivalent if: – Involve the same actions of the same transactions – Every pair of conflicting actions is ordered the same way – Pairs of conflicting actions: one must be W • Schedule S is conflict serializable if S is conflict equivalent to some serial schedule • Every conflict serializable schedule is serializable.