On successful completion of join node, the control is passed to the end node, which ends the process.
join节点成功完成之后，控制权就会传递给end节点，它会结束这个过程。
The join node waits for the completion of these two parallel routes before advancing to the second decision point.
连接点等待着两条平行路线都完成，然后进入第二个决策点。
We could then apply a tree manipulation to move the Filter node underneath the Join node toward the related Table node.
随后，我们可以应用一项树操作，将Join节点下方的Filter节点朝着相关Table节点的方向移动。
Rejoin parallel branches with a join node and then place a single end or stop node, instead of ending parallel branches individually.
利用一个join节点重新联接并行分支，然后放置一个结束或停止节点，而不是分别结束每个并行分支。
Therefore, a SORT node is also added to the outer of the join to enforce the order.
因此，也要添加sort节点到联接的外部来执行顺序。
The difference between Figure 6 and Figure 7 is that in Figure 7, a SORT node is added on the outer side of the join.
在图7 上图6与图 7之间所不同的是，一个SORT节点被添加到联接的外部。
The basic idea is to temporarily convert the nodes into a Linux system and from there they join the master node as member of a cluster.
其基本思想是将节点临时转换为Linux系统，然后作为集群的成员连接到主节点。
A "Split" node indicates the beginning of parallel routes, and a "Join" node waits for completion of all routes.
“分离(split)”节点表示平行传送的开始，“连接(join)”节点等待所有路线的完成。
If an MQT is defined as REPLICATED, it is possible to get better performance for an operation (e.g. join) that can use this MQT and correlates it with data on the same node through collocation.
如果MQT被定义为REPLICATED，那么可以使用该MQT的操作(比如，联结)就可能获得更好的性能，并通过排列(collocation)将它与相同节点上的数据相关联。
You should replace a join that only has start nodes as input with a single start node that directly connects to a task or subprocess.
您应当用一个直接连接到某个任务或子流程的开始节点，替换一个只使用开始节点作为输入的join。
The merge executes twice, once when it receives control from the lower start node, and again when it receives control from the join.
merge执行了两次，在接收到来自下面的开始节点的控制时会执行一次，而在接收到来自join的控制时会再次执行。
Note that we added a join to rejoin the two parallel branches so that they can lead to a single stop node.
注意，我们添加了一个join，以使两个并行的分支重新联接起来，引向某个停止节点。
Notice that there is a significant difference between the cardinality shown in the fetch node on the outer side of the join in Figure 7.
请注意在图7中联接的外部Fetch节点上所显示的基数之间有一个显著的不同。
This meant that a single node could take up to an hour to join the network, which made collecting data extremely time-consuming.
意思是单一节点要花费一个小时的时间才能接入网络系统，让收集数据这一动作费时极大。
The first cycle involves a backward connection that starts in the decision and leads back to the join following the start node.
在第一个循环中，有一个逆向连接从decision开始并引回位于开始节点之后的 join。
Immediately following the start node, a decision represents three alternative branches in the process flow that eventually lead to a join preceding Task 5.
在开始节点后，紧跟一个decision，它表示流程流中的三个可选分支，这些分支最终引向Task 5之前的join。
The user connected this start node and the join to a merge to represent the event logic (event1 and event2) OR event3.
用户将这个开始节点和join连接到一个merge，以表示事件逻辑(event1 ANDevent2) OR event3。
The join operation failed Because the cluster instance ID of the joining node does not match the cluster instance ID of the sponsor node.
加入操作失败，因为要加入的节点的群集范例ID与监护人节点上的群集范例ID不匹配。
The third cycle starts in the fork preceding the end node, and leads back to the join following the decision.
第三个循环从结束节点之前的 fork中开始，并引回decision之后的 join。
The cluster join operation failed due to incompatible software versions between the joining Node and its sponsor.
由于加入节点和支持者之间的软件版本不兼容，该群集加入操作失败。
To get the source nodes similar to the target query node, firstly the paths whose lengths were within an interval were extracted from the data source, then a similarity join process between them and.
为返回数据源中与查询目标节点相似的节点，首先提取出数据源中长度在固定范围内的所有路径，然后利用关系数据库系统将其与查询路径进行相似性连接，并按相似度从大到小返回所有结果。
The features of this routing structure are:(1) Combining tree and flow structure, which not only can lookup fast, but also can adapt to the dynamic node join or leave;
该路由结构的特点是：（1）结合了树结构和流结构，使该路由结构不仅能够快速查找，而且还能够适应动态的节点加入或离开；
The simulation results show that the designed structure reduces join and exit number of messages that each node sends and the search delay of information. It achieves good customer satisfaction.
仿真实验表明，设计的系统结构降低每个结点加入和退出时发送的消息数量，减少了信息检索延迟，取得了较好的用户满意度。
In the ALU, we integrate the method of equinoctial node-group and conditional sum adder to design reconfigurable ALU, and join negative logic circuit design design principle into it.
在ALU设计中，将二分结组的思想和条件求和相结合设计了可重组的ALU，并加入负逻辑的数字电路设计思想。
In the ALU, we integrate the method of equinoctial node-group and conditional sum adder to design reconfigurable ALU, and join negative logic circuit design design principle into it.
在ALU设计中，将二分结组的思想和条件求和相结合设计了可重组的ALU，并加入负逻辑的数字电路设计思想。
应用推荐