A buffering based cache-oblivious nest-loop parallel join algorithm is proposed.
提出了一种基于缓冲的高速缓存参数无关的嵌套循环并行连接算法。
This paper analyses the problems of load balancing on every site in parallel databases, presenting a parallel join algorithm with high efficiency and load balancing and analogue experiments are made.
本文分析了并行数据库中各结点的负载平衡问题，提出了一个高效且保持负载平衡的并行连接运算算法，并进行了模拟实验。
A pair of split and join nodes encompassing multiple parallel routes can reside on a parallel route in the scope of another pair of split and join nodes.
包含多条平行线路的一对分离/连接节点可能出现在另一对分离/连接节点的一条平行线路上。
The join node waits for the completion of these two parallel routes before advancing to the second decision point.
连接点等待着两条平行路线都完成，然后进入第二个决策点。
All the paths connecting Fork and Join nodes will be implemented in parallel.
与Fork和Join节点相连接的路径可以并行实现。
A "Split" node indicates the beginning of parallel routes, and a "Join" node waits for completion of all routes.
“分离(split)”节点表示平行传送的开始，“连接(join)”节点等待所有路线的完成。
Revisiting the example from Listing 6, notice that max() is a method already provided on parallel collections, so there is no need to define and invoke a fork/join task directly, as in Listing 7
再看一下清单6中的示例，注意到，max()是一个已经在并行集合中提供的方法，因此没有必要直接定义和调用fork/join任务，如清单 7 所示
A join waits for all of the parallel paths to complete before proceeding.
在继续之前，join将等待所有的并行路径完成。
Note that we added a join to rejoin the two parallel branches so that they can lead to a single stop node.
注意，我们添加了一个join，以使两个并行的分支重新联接起来，引向某个停止节点。
Rejoin parallel branches with a join node and then place a single end or stop node, instead of ending parallel branches individually.
利用一个join节点重新联接并行分支，然后放置一个结束或停止节点，而不是分别结束每个并行分支。
The role of the join action is to synchronize multiple threads of parallel execution started by fork actions.
join动作的功能是要同步fork动作启动的多个并行执行的线程。
Parallel parking would be a breeze, and I'd never be asked to join a car pool again.
并行停车将不费吹灰之力，而且我不会在被要求拼车了。
The pattern in Figure 14 presents the correct way to model parallel branching by using a matching fork-join pair.
图14中的模式展示了使用匹配的 fork-join 对建立并行分支模型的正确方法。
The parallel branches are joined again in a join, which ends the parallel execution.
这两个并行分支在join处再次联接，从而结束并行执行。
The principal benefit of using the fork-join technique is that it affords a portable means of coding algorithms for parallel execution.
使用fork-join技术的主要好处是，它提供了一种编写并行执行的算法的简便方法。
This kind of parallel decomposition is often called fork-join because executing a task forks (starts) multiple subtasks and then joins (waits for completion) with them.
这种并行分解方法常常称作fork-join，因为执行一个任务将首先分解（fork）为多个子任务，然后再合并（join）（完成后）。
You then use the description to actually execute the array operations (which USES the fork-join framework under the hood) in parallel.
然后用该描述并行地执行数组操作(幕后使用的是fork - join框架)。
Parallel branches can then be synchronized using the Join or Merge constructs.
并行的分支就可以通过使用Join或者Merge来实现同步。
Parallel lines are, by definition, lines on the same plane that never join.
按照定义，平行线是在同一平面上永不相交的线。
Parallel lines are lines that never join.
平行线是永不相交的线。
To improve the execution efficiency of the query processors, the authors exploit heuristics to seek the optimum parallel scheduling execution plan for multi-join expressions.
为了提高查询处理器的执行效率，采用启发式规则来搜索最优的多连接表达式并行调度执行计划。
This paper presents an optimized query algorithm, which adopts direct-join using data partition and parallel processing. It can reduce the response time of query process.
本文利用数据分片和并行处理策略，提出一种采用直接连接的查询优化算法，能有效地缩减查询处理的响应时间。
The multi-join query optimization is the critical problem of parallel query optimization in parallel database system.
多连接查询优化是并行数据库系统的核心问题。
Parallel lines are, by definition, lines that never join.
根据定义，平行线是永不相交的直线。
Parallel lines, by definition, never join.
根据定义，平行线永远不会相交。
The life always has many accidental and coincidence, two seemingly parallel lines that might join day, life and has many accidents and missed.
人生总有许多偶然和巧合，两条看似的平行线，也可能会有交汇的一天，人生又有许多意外和错过。
The life always has many accidental and coincidence, two seemingly parallel lines that might join day, life and has many accidents and missed.
人生总有许多偶然和巧合，两条看似的平行线，也可能会有交汇的一天，人生又有许多意外和错过。
应用推荐