• Listing 1. Merge-sort using the fork-join library.

    清单1.使用fork - join库进行合并排序。

    youdao

  • This paper considers SQL Group-By and aggregation based on merge-sort in parallel database systems.

    本文考虑并行数据库系统基于归并排序的分组操作集函数计算。

    youdao

  • Merge-sort is not an inherently parallel algorithm, as it can be done sequentially, and is popular when the data set is too large to fit in memory and must be sorted in pieces.

    合并排序本身并非并行算法因为可以顺序执行数据内存无法容纳必须分片保存的时候,经常使用合并排序。

    youdao

  • Join plan directives that force optimizer to use the designated join method to join tables in the query, either nested loop join, sort merge join, or dynamic hash join.

    连接计划指示强制优化器使用指定的连接方法连接查询中的要么嵌套循环连接、分类合并连接,要么是动态哈希连接。

    youdao

  • Perhaps your organization's habit with PDF is to have someone adept with a particular desktop word processor set up a "mail merge" sort of operation to parameterize document output.

    组织处理PDF惯例可能熟练掌握特定桌面处理程序的某个人建立某种类似邮件合并”的操作使文档输出参数化。

    youdao

  • Also, DB2 cannot use random order index columns as part of a sort merge join.

    另外DB 2无法排序合并合并连接使用随机顺序索引

    youdao

  • A hash join is usually faster than a sort merge join since there is no sort operation involved.

    连接通常分类合并连接因为没有涉及到分类操作

    youdao

  • Let's run merge sort on it, and then we'll look at the code.

    让我们这个列表上运行归并排序然后我们在看一下代码。

    youdao

  • Merge scan join (MSJOIN) with sort for outer and inner

    使用内部外部排序合并扫描联接 (MSJOIN)

    youdao

  • For example, implement merge sort.

    例如如何实现合并排序

    youdao

  • Emad Omara's parallel merge sort algorithm assumes that you will have full access to the machine's CPUs for the duration of the sorting operation.

    EmadOmara并行合并排序算法假设了在排序操作的过程(操作者)对计算机的所有CPU具有完全访问权限。

    youdao

  • 20 minutes: Coding question. For example, implement merge sort.

    接下来的20分钟编程问题例如如何实现合并排序

    youdao

  • In fact they must release energy in that way in order to degrade their orbits and get close enough to merge. Those gravitational waves could act sort of like a jet engine, explained Jonker.

    Jonker解释道,“事实上他们必须通过这种方式释放能量降低轨道,彼此靠近并最终融合这些重力产生类似喷气发动机效果。”

    youdao

  • The most commonly used join methods are nested-loop join, sort merge join and dynamic hash join.

    常用连接方法就是嵌套循环连接、分类合并连接动态哈希连接。

    youdao

  • Wow I can sort two lists, so I can merge two lists.

    可以,将两个列表排好序

    youdao

  • Merge sort has o (n log n) worst-case and average-case performance.

    合并排序最差性能平均性能o (nlog n)。

    youdao

  • The sort command can also merge already sorted files and check whether a file is sorted or not.

    sort命令可以合并已经排序文件检查某个文件是否已经排序。

    youdao

  • If the query includes a join, the optimizer must determine the join plan (hash, sort merge, or nested loop), and the order in which tables are evaluated or joined.

    如果查询包含连接那么优化器就必须确定连接计划(hashsort mergenestedloop),以及评估或连接次序

    youdao

  • If your timestamps are to the nanosecond, you can re-merge these files together and usually not lose the order of events ("sort -m").

    如果时间戳精确秒,可以重新合并这些文件并且通常不会打乱事项顺序(“sort -m”)。

    youdao

  • In the case of the UnionExpression class, the evaluate method evaluates the two operands, checks that the result is in both cases a node-set, and then forms the union using a sort-merge strategy.

    如果是unionexpressionevaluate方法操作数求值,检查情况下节点集的结果然后使用排序合并策略组成联合

    youdao

  • Merge sort takes this idea of divide and conquer, and it does the following: it says let's divide the list in half.

    归并排序如下步骤使用了分治思想:,把列表分成:,下面就是分治

    youdao

  • So again, if you're unwinding what's going on here, this — we sorted the left half which meant sort the left half, then the right half then the merge.

    同样如果展开正在进行一切-我们已对左半部分好了序,接着右半部分,接着合并

    youdao

  • Run merge sort on those. By induction, if it does the right thing, I'm going to get back two lists, and I'm going to then merge Them together. Notice what I'm going to do.

    这些上面运行归并排序根据归纳如果这样正确的,重新得到两个列表然后我会它们合并在一起

    youdao

  • Let's do selection and let's do merge sort here on the right just to see what actually happens.

    中间进行选择排序右边进行归并排序,看看会发生什么

    youdao

  • Use merge sort, in a binary search algorithm complexity: nlogn, n number two together, if can equal to a specific number m, the output yes, otherwise no output.

    说明:运用归并排序二分法查找算法复杂度nlognn个数两两相加等于特定m,则输出yes否则输出no

    youdao

  • It is easy to understand the concept of 2-way merge sort algorithms.

    二路归并排序算法思想比较容易理解

    youdao

  • It is easy to understand the concept of 2-way merge sort algorithms.

    二路归并排序算法思想比较容易理解

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定