Finally, it didn't involve integration of sets of data, which could have required sorting or more complex join logic.
最后，它不涉及数据集的集成，否则就会产生排序或更复杂的连接(join)逻辑。
We can create two data sets to get the work item's information and the relationship information directly, and then join the two data sets to find the relationships between of all work items.
我们可以创建两个数据集，以直接得到工作性的信息与关系，然后合并两个数据集以找到所有工作项目之间的关系。
Pointcuts can describe sets of join points by means of explicit enumeration.
切入点可以通过显式枚举方式描述连接点集合。
Input data sets go through some operation (filtering, aggregation, or a join) in the early stages of the WebSphere DataStage job that reduces their size.
在WebSphereDataStage作业的早期阶段中，输入数据要经过一些操作的处理(过滤、聚合或连接)，这些操作会缩小数据的规模。
For sorting and searching problems, the fork-join library gives you an even easier means of expressing parallelizable operations on data sets: the ParallelArray classes.
对于排序和搜索问题，fork - join库提供了一种表示可以并行化的数据集操作的非常简单的途径：parallelarray类。
There have been a number of algorithms proposed for structural join, and most of them are based on one of the following assumptions: the input element sets either have indexes or are ordered.
目前已经提出了许多结构连接的算法，它们中的大多数都基于如下的前提条件之一：输入元素集合存在索引或者有序。
Therefore, the join cardinality is the product of the cardinalities of two row sets, multiplied by the selectivity of the join predicate.
因此，连接行集数是两个行集的行集数的乘积，被选择的谓词连接的乘积。
The following illustration shows a conceptual view of two sets and the elements within those sets that are included in either an inner join or a left outer join.
下面的概念图显示了两个集合中的完整项目，以及这两个集合彼此进行内部联结或左外部联结之后剩下的项目。
The following illustration shows a conceptual view of two sets and the elements within those sets that are included in either an inner join or a left outer join.
下面的概念图显示了两个集合中的完整项目，以及这两个集合彼此进行内部联结或左外部联结之后剩下的项目。
应用推荐