首页
随机
最近更改
特殊页面
社群首页
参数设置
关于WHY42
免责声明
WHY42
搜索
用户菜单
登录
欢迎来到Riguz的小站!这是一个私人wiki,用来记录一些我的笔记。
查看“︁Yjs algorithm(YATA)”︁的源代码
←
Yjs algorithm(YATA)
因为以下原因,您没有权限编辑该页面:
您请求的操作仅限属于该用户组的用户执行:
用户
您可以查看和复制此页面的源代码。
= Notes on YATA paper = This is notes on ''Near Real-Time Peer-to-Peer Shared Editing on Extensible Data Types''<ref>https://www.researchgate.net/publication/310212186_Near_Real-Time_Peer-to-Peer_Shared_Editing_on_Extensible_Data_Types</ref>. == Rules == <q> We compose the following three rules in order to find a strict total order <math><_{c}</math> on conflicting operations. </q> strict total order(严格全序): A '''strict total order''' on a set <math>X</math> is a strict partial order on <math>X</math> in which any two distinct elements are comparable. That is, a strict total order is a binary relation <math><</math> on some Set <math>X</math>, which satisfies the following for all <math>a, b</math> and <math>c</math> in <math>X</math> <ref>https://en.wikipedia.org/wiki/Total_order</ref>: # Not <math>a < a</math> (irreflexive). # If <math>a < b</math> then not <math> b < a </math> (asymmetric). # If <math>a < b</math> and <math>b < c</math> then <math>a < c</math> (transitive). # If <math>a \neq b</math>, then <math>a < b</math> or <math>b < a</math> (connected). === Rule1: No line crossing === <q> Rule1: We forbid crossing of origin connections (red lines in the graphical representation) between conflicting insertions. This rule is easily explained using the graphical representation of insertions in the linked list. As we stated before, every insertion has an origin connection to an insertion to the left (to a predecessor). Only when two operations are concurrently inserted after the same insertion, they will have the same origin. </q> <math>o1 <_{rule1} o2 \Leftrightarrow o1 < origin2 \lor origin2 \leq origin1</math> * Red line refers to the connection from the operation to it's origin * The assumation is that ''o1'' and ''o2'' conflicts, which means that there's overlap between intentions of them. [[Image:Yata-rule1.png|600px]] === Rule2: transitivity on <c === transitivity: if 𝑎≤𝑏 and 𝑏≤𝑐, then 𝑎≤𝑐, for every 𝑎, 𝑏, and 𝑐 in 𝐴.<ref>https://leanprover.github.io/logic_and_proof/relations.html</ref> <q> Specifies transitivity on <math><_{c}</math>. Let <math> o_{1} <_{c} o_{2} </math>. Then following rule ensures, that there is no <math>o</math> that is greater than <math>o_{2}</math>, but smaller than <math>o_{1}</math>, with respect to <math><_{c}</math> </q> <math>o_{1} <_{rule2} o_{2} \Leftrightarrow \exists o : o_{2} <_{c} o \to o_{1} \leq o \Leftrightarrow \nexists o : o_{2} <_{c} o < o_{1}</math> === Rule3: Smaller ID placed left === <q> When two conflicting insertions have the same origin, the insertion with the smaller creator id is to the left. We borrow this rule from the OT approach. But in OT this rule is applied when the position parameters are equal. </q> <math> o_{1} <_{rule3} o_{2} \Leftrightarrow origin_{1} \equiv origin_{2} \to creator_{1} < creator_{2} </math> We get retrieve the total order function <math><_{c}</math> by enforcing all three rules: <math> \begin{align} o_{1} <_{c} o_{2} &\iff (o_{1} <_{rule1} o_{2}) \land (o_{1} <_{rule2} o_{2}) \land (o_{1} <_{rule3} o_{2}) \\ &\Leftrightarrow \quad o1 < origin2 \lor origin2 \leq origin1 \\ &\land \quad \nexists o : o_{2} <_{c} o < o_{1} \\ &\land \quad origin_{1} \equiv origin_{2} \to creator_{1} < creator_{2} \end{align} </math> and: <math> o_{1} \leq_{c} o_{2} \iff o_{1} <_{c} o_{2} \quad \lor \quad o_{1} \equiv o_{2} </math> == Correctness == <q> Therefore, we have to show that for all conflicting insertions o1, o2, and o3 the ordering function <math>c=<_{c}</math> is antisymmetric, transitive, and total. </q> antisymmetric(反对称关系)<ref>https://zh.wikipedia.org/wiki/%E5%8F%8D%E5%AF%B9%E7%A7%B0%E5%85%B3%E7%B3%BB</ref>: <math>\displaystyle \forall a,b\in X,\ aRb\land bRa\;\Rightarrow \;a=b</math> <math> \begin{align} o_{1} \leq_{c} o_{2} \land o_{2} \leq_{c} o_{1} \quad &\implies \quad o_{1} \equiv o_{2} \quad (antisymmetry) \\ o_{1} \leq_{c} o_{2} \land o_{2} \leq_{c} o_{3} \quad &\implies \quad o_{1} \leq_{c} o_{3} \quad (transitivity) \\ o_{1} \leq_{c} o_{2} \quad &\lor \quad o_{2} \leq_{c} o_{1} \quad (totality) \end{align} </math> [[Category:Yjs]] [[Category:CRDT]]
返回
Yjs algorithm(YATA)
。