You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@drill.apache.org by "ASF GitHub Bot (JIRA)" <ji...@apache.org> on 2017/12/18 17:37:00 UTC
[jira] [Commented] (DRILL-6030) Managed sort should minimize number
of batches in a k-way merge
[ https://issues.apache.org/jira/browse/DRILL-6030?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16295312#comment-16295312 ]
ASF GitHub Bot commented on DRILL-6030:
---------------------------------------
GitHub user vrozov opened a pull request:
https://github.com/apache/drill/pull/1075
DRILL-6030: Managed sort should minimize number of batches in a k-way merge
@paul-rogers Please review
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/vrozov/drill DRILL-6030
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/drill/pull/1075.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #1075
----
commit f40d962cf35574c0406937de1ee86ef853234b3e
Author: Vlad Rozov <vr...@apache.org>
Date: 2017-12-17T17:25:55Z
DRILL-6030: Managed sort should minimize number of batches in a k-way merge
----
> Managed sort should minimize number of batches in a k-way merge
> ---------------------------------------------------------------
>
> Key: DRILL-6030
> URL: https://issues.apache.org/jira/browse/DRILL-6030
> Project: Apache Drill
> Issue Type: Improvement
> Reporter: Vlad Rozov
> Assignee: Vlad Rozov
>
> The time complexity of the algorithm is O(n*k*log(k)) where k is a number of batches to merge and n is a number of records in each batch (assuming equal size batches). As n*k is the total number of record to merge and it can be quite large, minimizing k should give better results.
--
This message was sent by Atlassian JIRA
(v6.4.14#64029)