You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@impala.apache.org by "Thomas Tauber-Marshall (JIRA)" <ji...@apache.org> on 2017/07/17 15:48:00 UTC
[jira] [Created] (IMPALA-5669) Partial sort node should operate
within a memory constraint
Thomas Tauber-Marshall created IMPALA-5669:
----------------------------------------------
Summary: Partial sort node should operate within a memory constraint
Key: IMPALA-5669
URL: https://issues.apache.org/jira/browse/IMPALA-5669
Project: IMPALA
Issue Type: Improvement
Components: Backend
Affects Versions: Impala 2.10.0
Reporter: Thomas Tauber-Marshall
Priority: Critical
A change currently in review, IMPALA-5498, adds a new exec node PartialSortNode. Initially, it will just allocate memory up to the query memory limit, but once the new buffer management work in IMPALA-3200 goes in, it should be modified to operate within a memory constraint.
PartialSortNode can operate with essentially any amount of memory, with the tradeoff that a smaller limit leads to a "lower quality", more random sort. We should investigate the performance implications of different limits, and consider making the limit configurable.
--
This message was sent by Atlassian JIRA
(v6.4.14#64029)