blocks|key|83340|text|冲突可序列化是可序列化的子集，所以仅仅因为调度是冲突可序列化就意味着它是可序列化的。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|83341|请参阅cow书籍数据库管理系统第2版，第19.1.1章，P541|83342|83343|每个冲突的可序列化调度都是可序列化的。|blockquote|83344|83345|83346|可序列化但不冲突的可序列化调度是|83347|T1+:+R(A)+++++++W(A)+C
T2+:+++++W(A)+C
T3+:+++++++++++++++++++W(A)+C|code-block|syntax|javascript|83348|这不是冲突可序列化的(按优先级图)，但等同于可序列化的调度|83349|T1+T2+T3|83350|因为T3盲写入两个调度中的输出。|83351|entityMap^0|0|0|0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Z|8|@]|9|@]|A|$]]|$1|D|3|-4|5|6|7|10|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|11|8|@]|9|@]|A|$]]|$1|H|3|-4|5|6|7|12|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|13|8|@]|9|@]|A|$]]|$1|J|3|K|5|6|7|14|8|@]|9|@]|A|$]]|$1|L|3|M|5|N|7|15|8|@]|9|@]|A|$O|P]]|$1|Q|3|R|5|6|7|16|8|@]|9|@]|A|$]]|$1|S|3|T|5|N|7|17|8|@]|9|@]|A|$O|P]]|$1|U|3|V|5|6|7|18|8|@]|9|@]|A|$]]|$1|W|3|-4|5|6|7|19|8|@]|9|@]|A|$]]]|X|$]]

Conflict serializable is a subset of serializable, so just because a schedule is conflict serializable does mean it is serializable.

See cow book Database Management System 2rd Ed Cha19.1.1 P541

<blockquote>
 Every conflict serializable schedule is serializable.
</blockquote>

A serializable but not conflict serializable schedule is 

<pre><code>T1 : R(A) W(A) C
T2 : W(A) C
T3 : W(A) C
</code></pre>

This is not conflict serializable (by precedence graph) but is equivalent to serializable schedule

<pre><code>T1 T2 T3
</code></pre>

because T3 blind writes the output in both schedule.

blocks|key|4858828|text|serializability.的子集是Conflict+serializability如果调度是冲突可序列化的，则暗示此调度是可序列化的。|type|unstyled|depth|inlineStyleRanges|offset|length|style|BOLD|entityRanges|data|4858829|与仅仅是可序列化的相比，在计算上更容易确定某些东西是否是冲突可序列化的。只需构造一个precedence+graph。如果图是非循环的，则此调度是冲突的-等价于图的路径所描述的某些串行调度。|4858830|想象一下事务A、B和C都写到同一页上。A写入，然后是B，然后是C，然后是A。没有冲突等价的可序列化调度。A必须先走，因为B和C在A之后有冲突。但是A也必须在最后走，因为B和C在A之前有冲突。因此图中的循环。|4858831|但是，仅仅因为它不是冲突可序列化的并不意味着它是不可序列化的。例如，如果A的最后一次写入与C的写入完全相同，那么ABC将是一个与原始调度等价的串行调度，因为最后一次写入无关紧要。|4858832|entityMap|0|LINK|mutability|MUTABLE|url|http://www.geeksforgeeks.org/precedence-graph-testing-conflict-serializability/^0|0|F|K|O|0|16|G|0|0|0|0^^$0|@$1|2|3|4|5|6|7|T|8|@$9|U|A|V|B|C]|$9|W|A|X|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|Y|8|@]|D|@$9|Z|A|10|1|11]]|E|$]]|$1|H|3|I|5|6|7|12|8|@]|D|@]|E|$]]|$1|J|3|K|5|6|7|13|8|@]|D|@]|E|$]]|$1|L|3|-4|5|6|7|14|8|@]|D|@]|E|$]]]|M|$N|$5|O|P|Q|E|$R|S]]]]

Conflict serializability is a subset of serializability. If a schedule is conflict serializable, it is implied that this schedules is serializable.

It is computationally easier to determine if something is conflict serializable as opposed to just serializable. Simply construct a <a href="http://www.geeksforgeeks.org/precedence-graph-testing-conflict-serializability/" rel="nofollow noreferrer">precedence graph</a>. If the graph is non-cyclic, then this schuedule is conflict-equivalent to some serial schedule described by the pathing of the graph. 

Imagine transactions A B and C, all writing to the same page. A writes, then B, then C, then A again. There is no serializable schedule that is conflict-equivalent. A must go first, because B and C have a conflict after A. But A must also go last, since B and C have a conflict before A. Hence the cycle in the graph.

But just because it is not conflict serializable does not mean it is not serializable. For example, if the last write of A was exactly the same as C's write, then ABC would be a serial schedule equivalent to the original, because the last write didn't end up mattering.

blocks|key|1994987|text|冲突可序列化是视图可序列化的子集。“调度可以是冲突可序列化的，但不是视图可序列化的(就像在盲写的情况下一样)。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1994988|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

Conflict serializable is a subset of view serializable. "A schedule can be conflict serializable but not view serializable(as in case of blind writes)

blocks|key|83369|text|简单地说，假设有一个具有两个事务T1+T2调度(S)。设Result1，Result2为两个变量，其中运行T1后产生Result1，然后运行T2，即T1->+T2；(串行)运行T2后产生Result2，然后运行T1，即T2->T1；(串行)|type|unstyled|depth|inlineStyleRanges|entityRanges|data|83370|现在假设我们交错两个事务的操作，让我们称之为调度S，现在如果在运行S之后产生的净结果等于Result1或Result2，那么我们称它为可序列化的。|83371|但是，如果我们可以交换不冲突的操作，并产生一个等于调度的串行调度，其中T1首先运行，然后T2(T1->+T2+)，或者T2首先运行，然后T1(T2->T1)，那么我们称之为冲突可串行化。|offset|length|style|BOLD|83372|现在，如果调度是冲突可串行化的，那么它必然是可串行化的，因为它可以通过交换非冲突操作来更改为某个串行顺序。|83373|因此，我们可以得出结论，每个冲突可串行化调度都是可串行化的，但并不是所有可串行化调度都是冲突可串行化的。|83374|entityMap^0|0|0|N|2|0|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Q|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|R|8|@$F|S|G|T|H|I]]|9|@]|A|$]]|$1|J|3|K|5|6|7|U|8|@]|9|@]|A|$]]|$1|L|3|M|5|6|7|V|8|@]|9|@]|A|$]]|$1|N|3|-4|5|6|7|W|8|@]|9|@]|A|$]]]|O|$]]

In simple Words,
Suppose there is a schedule(S) with two transaction T1,T2.
Let Result1, Result2 be two variables, where 
Result1 is produced after running T1 and then T2, i.e T1->T2;(serially)
Result2 is produced after running T2 and then T1, i.e T2->T1;(serially)

Now suppose we interleave the actions of the two transaction, let us call it schedule S, now if the net result produced after running S is equivalent to Result1 or Result2 then we call it serializable.

But, if we can swap the non-conflicting actions and produce a serial schedule that is equal to a schedule in which T1 is run first and then T2(T1->T2), or T2 is run first and then T1(T2->T1) then we call it conflict-serializable.

Now if a schedule is conflict-serializable then it is bound to be serializable as it can be changed to some serial order by swapping the non-conflicting actions.

Hence we can conclude, every conflict-serializable schedule is serializable but not all serializable schedule are conflict-serializable.

blocks|key|2746099|text|直接定义并理解冲突的行为：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2746100|如果一个调度与某个串行调度冲突，则该调度是冲突可串行化的。每个冲突的可序列化调度都是可序列化的。|2746101|​|2746102|📷|atomic|offset|length|2746103|2746104|上面的例子是可序列化的，但不是冲突可序列化的。没有这样的序列具有相同的冲突动作。可串行化，因为它仍然实现了串行T1->T2->T3的并发性，但不共享冲突的操作。在与串行相反的示例中，T1和T2的写入顺序不同。|2746105|entityMap|0|IMAGE|mutability|IMMUTABLE|imageUrl|https://ask.qcloudimg.com/http-save/yehe-900000/46df59a8bb632085228f24530aa94302.png|imageAlt^0|0|0|0|0|1|0|0|0|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|X|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|Y|8|@]|9|@]|A|$]]|$1|F|3|G|5|H|7|Z|8|@]|9|@$I|10|J|11|1|12]]|A|$]]|$1|K|3|E|5|6|7|13|8|@]|9|@]|A|$]]|$1|L|3|M|5|6|7|14|8|@]|9|@]|A|$]]|$1|N|3|-4|5|6|7|15|8|@]|9|@]|A|$]]]|O|$P|$5|Q|R|S|A|$T|U|V|-4]]]]

Straight Definition with the understanding of conflicting actions:

A schedule is conflict serializable if it is conflict equivalent to some serial schedule. Every conflict serializable schedule is serializable.

<a href="https://i.stack.imgur.com/F3hlC.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/F3hlC.png" alt="enter image description here"></a>

The above example is serializable but not conflict serializable. There is no such serial that has the same conflicting actions. Serializable because it still achieves concurrency to serial T1->T2->T3, but does not share conflicting actions. The writes of T1 and T2 are in different order in the example opposed to the serial.

blocks|key|1995061|text|可序列化有两种类型:冲突和视图。Conflict+serializable确定计划是否等同于某个串行计划，使冲突操作(R-W或W-R或W-W)与原始计划中的顺序相同。|type|unstyled|depth|inlineStyleRanges|offset|length|style|BOLD|entityRanges|data|1995062|entityMap^0|G|L|0^^$0|@$1|2|3|4|5|6|7|H|8|@$9|I|A|J|B|C]]|D|@]|E|$]]|$1|F|3|-4|5|6|7|K|8|@]|D|@]|E|$]]]|G|$]]

Serializability has two types: Conflict and View.
Conflict serializable determines if a schedule is equivalent to some serial schedule keeping the conflicting operations(R-W or W-R or W-W) in the same sequence as in the original schedule.

My understanding is that conflict serializable implies serializable. I'm not sure how that makes them different. Does serializable mean conflict serializable?

What's the Difference between Conflict Serializable and Serializable?

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云AI代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

功能1上新10个字符

功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符。

功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符。

功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符

功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符

功能4上新

文章&问答评论现已支持表情

全新交互，全新视觉，新增快捷键、悬浮工具栏、高亮块等功能并同时优化现有功能，全面提升创作效率和体验

社区富文本编辑器全新改版！诚邀体验～ 

精选全网热门MCP server，让你的AI更好用 🚀

💥开发者 MCP广场重磅上线！

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

我的理解是冲突可序列化意味着可序列化。我不确定这有什么不同。可序列化是否意味着冲突可序列化？

问Conflict Serializable和Serializable有什么区别？
EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Conflict Serializable和Serializable有什么区别？EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Conflict Serializable和Serializable有什么区别？
EN