You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@drill.apache.org by "Vlad Rozov (JIRA)" <ji...@apache.org> on 2017/12/18 17:42:03 UTC
[jira] [Updated] (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:all-tabpanel ]
Vlad Rozov updated DRILL-6030:
------------------------------
Reviewer: Paul Rogers
> 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)